./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/parallel-barrier-loop.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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:28,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:28,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:58:28,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:28,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:28,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:28,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:28,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:28,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:28,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:28,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:28,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:28,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:28,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:28,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:28,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:28,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:28,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:28,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:28,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:28,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:28,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:28,577 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:28,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:28,578 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:28,578 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:28,578 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:28,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:28,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:28,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:28,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:28,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:28,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:28,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:28,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:28,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:28,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:28,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:28,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:28,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:28,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:28,582 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2024-11-19 05:58:28,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:28,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:28,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:28,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:28,840 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:28,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-19 05:58:30,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:58:30,542 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:58:30,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-19 05:58:30,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94423c96/ef009ea58531472995029aba8064c58d/FLAGbc99982a3 [2024-11-19 05:58:30,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d94423c96/ef009ea58531472995029aba8064c58d [2024-11-19 05:58:30,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:58:30,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:58:30,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:30,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:58:30,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:58:30,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df87d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30, skipping insertion in model container [2024-11-19 05:58:30,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:58:30,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:30,827 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:58:30,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:30,864 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:58:30,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30 WrapperNode [2024-11-19 05:58:30,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:30,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:30,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:58:30,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:58:30,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,906 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 309 [2024-11-19 05:58:30,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:30,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:58:30,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:58:30,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:58:30,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:58:30,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:58:30,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:58:30,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:58:30,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (1/1) ... [2024-11-19 05:58:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:58:30,973 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-19 05:58:30,981 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-19 05:58:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:58:31,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:58:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:58:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:58:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:58:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:58:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:58:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 05:58:31,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 05:58:31,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:58:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-19 05:58:31,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-19 05:58:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-19 05:58:31,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-19 05:58:31,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:58:31,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:58:31,018 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:58:31,114 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:58:31,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:58:31,485 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:58:31,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:58:31,503 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:58:31,504 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 05:58:31,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:31 BoogieIcfgContainer [2024-11-19 05:58:31,504 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:58:31,506 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:58:31,506 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:58:31,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:58:31,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:58:30" (1/3) ... [2024-11-19 05:58:31,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755aaef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:31, skipping insertion in model container [2024-11-19 05:58:31,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:30" (2/3) ... [2024-11-19 05:58:31,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755aaef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:31, skipping insertion in model container [2024-11-19 05:58:31,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:31" (3/3) ... [2024-11-19 05:58:31,511 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-11-19 05:58:31,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:58:31,524 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-19 05:58:31,525 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:58:31,680 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-19 05:58:31,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2024-11-19 05:58:31,887 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2024-11-19 05:58:31,887 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:58:31,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 925 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. [2024-11-19 05:58:31,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2024-11-19 05:58:31,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2024-11-19 05:58:31,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:58:31,931 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;@5931216b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:58:31,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-19 05:58:31,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:58:31,939 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-11-19 05:58:31,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:58:31,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:31,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:31,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 684120472, now seen corresponding path program 1 times [2024-11-19 05:58:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32191985] [2024-11-19 05:58:31,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:32,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32191985] [2024-11-19 05:58:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32191985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:32,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560284950] [2024-11-19 05:58:32,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:32,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:32,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:32,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:32,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:32,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:32,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:32,800 INFO L124 PetriNetUnfolderBase]: 116/1711 cut-off events. [2024-11-19 05:58:32,801 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-11-19 05:58:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1711 events. 116/1711 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12312 event pairs, 56 based on Foata normal form. 157/1625 useless extension candidates. Maximal degree in co-relation 1869. Up to 151 conditions per place. [2024-11-19 05:58:32,830 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 20 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2024-11-19 05:58:32,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 815 flow [2024-11-19 05:58:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-19 05:58:32,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-19 05:58:32,856 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1128 transitions. [2024-11-19 05:58:32,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 815 flow [2024-11-19 05:58:32,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 786 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-19 05:58:32,875 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2024-11-19 05:58:32,877 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-11-19 05:58:32,883 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2024-11-19 05:58:32,883 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2024-11-19 05:58:32,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:32,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:32,888 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-19 05:58:32,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:58:32,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:32,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2031107495, now seen corresponding path program 1 times [2024-11-19 05:58:32,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:32,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103439227] [2024-11-19 05:58:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:32,984 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-19 05:58:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103439227] [2024-11-19 05:58:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103439227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:32,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335164154] [2024-11-19 05:58:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:33,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:33,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:33,330 INFO L124 PetriNetUnfolderBase]: 116/1709 cut-off events. [2024-11-19 05:58:33,330 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 05:58:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 1709 events. 116/1709 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11696 event pairs, 56 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 1878. Up to 151 conditions per place. [2024-11-19 05:58:33,343 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-19 05:58:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 786 flow [2024-11-19 05:58:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:33,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:33,346 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 786 flow [2024-11-19 05:58:33,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:33,353 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2024-11-19 05:58:33,353 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361} [2024-11-19 05:58:33,354 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-19 05:58:33,354 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2024-11-19 05:58:33,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:33,355 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] [2024-11-19 05:58:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:58:33,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:33,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1682370515, now seen corresponding path program 1 times [2024-11-19 05:58:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601877946] [2024-11-19 05:58:33,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,407 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-19 05:58:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601877946] [2024-11-19 05:58:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601877946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096676368] [2024-11-19 05:58:33,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:33,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:33,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:33,581 INFO L124 PetriNetUnfolderBase]: 116/1156 cut-off events. [2024-11-19 05:58:33,582 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-19 05:58:33,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1156 events. 116/1156 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6980 event pairs, 56 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1318. Up to 163 conditions per place. [2024-11-19 05:58:33,600 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-19 05:58:33,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 784 flow [2024-11-19 05:58:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:33,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:33,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:33,602 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:33,602 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:33,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 784 flow [2024-11-19 05:58:33,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:33,607 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2024-11-19 05:58:33,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360} [2024-11-19 05:58:33,608 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-19 05:58:33,608 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2024-11-19 05:58:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:33,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:58:33,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:58:33,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:33,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 510584919, now seen corresponding path program 1 times [2024-11-19 05:58:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693157053] [2024-11-19 05:58:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,667 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-19 05:58:33,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693157053] [2024-11-19 05:58:33,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693157053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908864148] [2024-11-19 05:58:33,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:33,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:33,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:33,829 INFO L124 PetriNetUnfolderBase]: 116/1155 cut-off events. [2024-11-19 05:58:33,829 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-19 05:58:33,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1155 events. 116/1155 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6823 event pairs, 56 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1310. Up to 163 conditions per place. [2024-11-19 05:58:33,844 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-19 05:58:33,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 782 flow [2024-11-19 05:58:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:33,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:33,847 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 782 flow [2024-11-19 05:58:33,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:33,852 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2024-11-19 05:58:33,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2024-11-19 05:58:33,853 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2024-11-19 05:58:33,853 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2024-11-19 05:58:33,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:33,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:33,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:58:33,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:33,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash -315095758, now seen corresponding path program 1 times [2024-11-19 05:58:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:33,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364193393] [2024-11-19 05:58:33,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,886 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-19 05:58:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364193393] [2024-11-19 05:58:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364193393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117017590] [2024-11-19 05:58:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:33,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:33,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:33,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,114 INFO L124 PetriNetUnfolderBase]: 110/1386 cut-off events. [2024-11-19 05:58:34,115 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-19 05:58:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1386 events. 110/1386 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8907 event pairs, 56 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1526. Up to 151 conditions per place. [2024-11-19 05:58:34,132 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-19 05:58:34,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 780 flow [2024-11-19 05:58:34,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:34,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:34,136 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:34,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 780 flow [2024-11-19 05:58:34,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,141 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2024-11-19 05:58:34,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358} [2024-11-19 05:58:34,142 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2024-11-19 05:58:34,142 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2024-11-19 05:58:34,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,143 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:34,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:58:34,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:34,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1140211658, now seen corresponding path program 1 times [2024-11-19 05:58:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922057449] [2024-11-19 05:58:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,176 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-19 05:58:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922057449] [2024-11-19 05:58:34,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922057449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62282514] [2024-11-19 05:58:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:34,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:34,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,363 INFO L124 PetriNetUnfolderBase]: 110/1385 cut-off events. [2024-11-19 05:58:34,363 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-19 05:58:34,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1385 events. 110/1385 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8321 event pairs, 56 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1518. Up to 151 conditions per place. [2024-11-19 05:58:34,373 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-19 05:58:34,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 778 flow [2024-11-19 05:58:34,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:34,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:34,376 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:34,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 778 flow [2024-11-19 05:58:34,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,380 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2024-11-19 05:58:34,380 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2024-11-19 05:58:34,381 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2024-11-19 05:58:34,381 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2024-11-19 05:58:34,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,382 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:34,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:58:34,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:34,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1776993455, now seen corresponding path program 1 times [2024-11-19 05:58:34,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365320293] [2024-11-19 05:58:34,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,414 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-19 05:58:34,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365320293] [2024-11-19 05:58:34,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365320293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219311636] [2024-11-19 05:58:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:34,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:34,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,532 INFO L124 PetriNetUnfolderBase]: 112/926 cut-off events. [2024-11-19 05:58:34,532 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-19 05:58:34,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 926 events. 112/926 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4933 event pairs, 56 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1052. Up to 163 conditions per place. [2024-11-19 05:58:34,542 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-19 05:58:34,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 776 flow [2024-11-19 05:58:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:34,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:34,544 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:34,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 776 flow [2024-11-19 05:58:34,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,548 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2024-11-19 05:58:34,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2024-11-19 05:58:34,549 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-19 05:58:34,549 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2024-11-19 05:58:34,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,550 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:58:34,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:34,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1223676544, now seen corresponding path program 1 times [2024-11-19 05:58:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189644157] [2024-11-19 05:58:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,578 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-19 05:58:34,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189644157] [2024-11-19 05:58:34,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189644157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031462426] [2024-11-19 05:58:34,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-19 05:58:34,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-19 05:58:34,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,717 INFO L124 PetriNetUnfolderBase]: 112/925 cut-off events. [2024-11-19 05:58:34,718 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-19 05:58:34,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 925 events. 112/925 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4886 event pairs, 56 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1044. Up to 163 conditions per place. [2024-11-19 05:58:34,724 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-19 05:58:34,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 774 flow [2024-11-19 05:58:34,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-19 05:58:34,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-19 05:58:34,726 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1115 transitions. [2024-11-19 05:58:34,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 774 flow [2024-11-19 05:58:34,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,730 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2024-11-19 05:58:34,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2024-11-19 05:58:34,731 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2024-11-19 05:58:34,731 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2024-11-19 05:58:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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-19 05:58:34,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,732 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-19 05:58:34,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:58:34,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:34,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1915489821, now seen corresponding path program 1 times [2024-11-19 05:58:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208996168] [2024-11-19 05:58:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,788 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-19 05:58:34,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208996168] [2024-11-19 05:58:34,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208996168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656269384] [2024-11-19 05:58:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:34,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:34,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:34,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,003 INFO L124 PetriNetUnfolderBase]: 191/1845 cut-off events. [2024-11-19 05:58:35,003 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-19 05:58:35,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 1845 events. 191/1845 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13759 event pairs, 72 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 2122. Up to 204 conditions per place. [2024-11-19 05:58:35,025 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-19 05:58:35,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 811 flow [2024-11-19 05:58:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-19 05:58:35,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-19 05:58:35,027 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2024-11-19 05:58:35,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 811 flow [2024-11-19 05:58:35,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,032 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2024-11-19 05:58:35,032 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-19 05:58:35,033 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:35,033 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2024-11-19 05:58:35,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:35,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,034 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:35,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:58:35,034 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:35,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1422681314, now seen corresponding path program 1 times [2024-11-19 05:58:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634820604] [2024-11-19 05:58:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,089 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-19 05:58:35,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634820604] [2024-11-19 05:58:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634820604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645859413] [2024-11-19 05:58:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:35,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-19 05:58:35,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:35,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,342 INFO L124 PetriNetUnfolderBase]: 171/1831 cut-off events. [2024-11-19 05:58:35,342 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-19 05:58:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1831 events. 171/1831 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 13577 event pairs, 40 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 1175. Up to 129 conditions per place. [2024-11-19 05:58:35,362 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-19 05:58:35,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 836 flow [2024-11-19 05:58:35,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-19 05:58:35,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-19 05:58:35,365 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 728 flow. Second operand 3 states and 1138 transitions. [2024-11-19 05:58:35,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 836 flow [2024-11-19 05:58:35,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,371 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 732 flow [2024-11-19 05:58:35,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-19 05:58:35,374 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:35,374 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 732 flow [2024-11-19 05:58:35,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-19 05:58:35,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,375 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] [2024-11-19 05:58:35,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:58:35,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:35,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash -894769896, now seen corresponding path program 1 times [2024-11-19 05:58:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116653356] [2024-11-19 05:58:35,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,459 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-19 05:58:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116653356] [2024-11-19 05:58:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116653356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814496239] [2024-11-19 05:58:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,480 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:35,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:35,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,775 INFO L124 PetriNetUnfolderBase]: 292/1806 cut-off events. [2024-11-19 05:58:35,776 INFO L125 PetriNetUnfolderBase]: For 114/130 co-relation queries the response was YES. [2024-11-19 05:58:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1806 events. 292/1806 cut-off events. For 114/130 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12350 event pairs, 113 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 1749. Up to 314 conditions per place. [2024-11-19 05:58:35,806 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-19 05:58:35,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 812 flow [2024-11-19 05:58:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-19 05:58:35,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-19 05:58:35,811 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 732 flow. Second operand 3 states and 1128 transitions. [2024-11-19 05:58:35,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 812 flow [2024-11-19 05:58:35,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 361 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:35,816 INFO L231 Difference]: Finished difference. Result has 356 places, 353 transitions, 732 flow [2024-11-19 05:58:35,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=353} [2024-11-19 05:58:35,818 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:35,818 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 353 transitions, 732 flow [2024-11-19 05:58:35,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:35,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,819 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] [2024-11-19 05:58:35,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:58:35,819 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:35,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash 936481567, now seen corresponding path program 1 times [2024-11-19 05:58:35,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890179826] [2024-11-19 05:58:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,866 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-19 05:58:35,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890179826] [2024-11-19 05:58:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890179826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631296934] [2024-11-19 05:58:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:35,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 353 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:35,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:35,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,287 INFO L124 PetriNetUnfolderBase]: 362/2136 cut-off events. [2024-11-19 05:58:36,287 INFO L125 PetriNetUnfolderBase]: For 145/151 co-relation queries the response was YES. [2024-11-19 05:58:36,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 2136 events. 362/2136 cut-off events. For 145/151 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15290 event pairs, 119 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 2502. Up to 364 conditions per place. [2024-11-19 05:58:36,318 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-19 05:58:36,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 818 flow [2024-11-19 05:58:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-19 05:58:36,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-19 05:58:36,322 INFO L175 Difference]: Start difference. First operand has 356 places, 353 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2024-11-19 05:58:36,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 818 flow [2024-11-19 05:58:36,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,328 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 730 flow [2024-11-19 05:58:36,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-19 05:58:36,329 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-19 05:58:36,329 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 730 flow [2024-11-19 05:58:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:36,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,330 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-19 05:58:36,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:58:36,331 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:36,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1521898020, now seen corresponding path program 1 times [2024-11-19 05:58:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402983263] [2024-11-19 05:58:36,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,375 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-19 05:58:36,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402983263] [2024-11-19 05:58:36,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402983263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496469001] [2024-11-19 05:58:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:36,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:36,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:36,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,786 INFO L124 PetriNetUnfolderBase]: 253/2046 cut-off events. [2024-11-19 05:58:36,787 INFO L125 PetriNetUnfolderBase]: For 101/113 co-relation queries the response was YES. [2024-11-19 05:58:36,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 2046 events. 253/2046 cut-off events. For 101/113 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14326 event pairs, 63 based on Foata normal form. 0/1740 useless extension candidates. Maximal degree in co-relation 2468. Up to 203 conditions per place. [2024-11-19 05:58:36,804 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-19 05:58:36,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 830 flow [2024-11-19 05:58:36,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-19 05:58:36,807 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-19 05:58:36,807 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2024-11-19 05:58:36,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 830 flow [2024-11-19 05:58:36,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 364 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,811 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 734 flow [2024-11-19 05:58:36,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-19 05:58:36,812 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-19 05:58:36,812 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 734 flow [2024-11-19 05:58:36,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:36,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,813 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-19 05:58:36,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:58:36,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1384226096, now seen corresponding path program 1 times [2024-11-19 05:58:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770757191] [2024-11-19 05:58:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,847 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-19 05:58:36,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770757191] [2024-11-19 05:58:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770757191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112465543] [2024-11-19 05:58:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:36,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:36,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:37,239 INFO L124 PetriNetUnfolderBase]: 414/2575 cut-off events. [2024-11-19 05:58:37,240 INFO L125 PetriNetUnfolderBase]: For 203/227 co-relation queries the response was YES. [2024-11-19 05:58:37,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 2575 events. 414/2575 cut-off events. For 203/227 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18953 event pairs, 91 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2370. Up to 307 conditions per place. [2024-11-19 05:58:37,266 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-19 05:58:37,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 835 flow [2024-11-19 05:58:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:37,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:37,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-19 05:58:37,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-19 05:58:37,269 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 734 flow. Second operand 3 states and 1137 transitions. [2024-11-19 05:58:37,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 835 flow [2024-11-19 05:58:37,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 364 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:37,274 INFO L231 Difference]: Finished difference. Result has 356 places, 352 transitions, 740 flow [2024-11-19 05:58:37,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=352} [2024-11-19 05:58:37,275 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:37,275 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 352 transitions, 740 flow [2024-11-19 05:58:37,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:37,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:37,276 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] [2024-11-19 05:58:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:58:37,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:37,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 116901643, now seen corresponding path program 1 times [2024-11-19 05:58:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183835061] [2024-11-19 05:58:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:37,318 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-19 05:58:37,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183835061] [2024-11-19 05:58:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183835061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:37,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:37,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210079649] [2024-11-19 05:58:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:37,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:37,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:37,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:37,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:37,332 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:37,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 352 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 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-19 05:58:37,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:37,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:37,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:37,868 INFO L124 PetriNetUnfolderBase]: 808/3108 cut-off events. [2024-11-19 05:58:37,869 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-11-19 05:58:37,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 3108 events. 808/3108 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 22162 event pairs, 266 based on Foata normal form. 0/2371 useless extension candidates. Maximal degree in co-relation 3187. Up to 797 conditions per place. [2024-11-19 05:58:37,902 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-19 05:58:37,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 825 flow [2024-11-19 05:58:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-19 05:58:37,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-19 05:58:37,905 INFO L175 Difference]: Start difference. First operand has 356 places, 352 transitions, 740 flow. Second operand 3 states and 1129 transitions. [2024-11-19 05:58:37,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 825 flow [2024-11-19 05:58:37,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:37,910 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 740 flow [2024-11-19 05:58:37,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-19 05:58:37,913 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:37,913 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 740 flow [2024-11-19 05:58:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 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-19 05:58:37,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:37,914 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] [2024-11-19 05:58:37,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:58:37,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -600548039, now seen corresponding path program 1 times [2024-11-19 05:58:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294709504] [2024-11-19 05:58:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:37,964 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-19 05:58:37,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:37,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294709504] [2024-11-19 05:58:37,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294709504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:37,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:37,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:37,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008740260] [2024-11-19 05:58:37,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:37,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:37,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:37,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:37,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:37,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:37,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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-19 05:58:37,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:37,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:37,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:38,466 INFO L124 PetriNetUnfolderBase]: 609/3336 cut-off events. [2024-11-19 05:58:38,466 INFO L125 PetriNetUnfolderBase]: For 401/434 co-relation queries the response was YES. [2024-11-19 05:58:38,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 3336 events. 609/3336 cut-off events. For 401/434 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24794 event pairs, 142 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 3120. Up to 466 conditions per place. [2024-11-19 05:58:38,514 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 29 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-19 05:58:38,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 837 flow [2024-11-19 05:58:38,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-19 05:58:38,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-19 05:58:38,518 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 740 flow. Second operand 3 states and 1136 transitions. [2024-11-19 05:58:38,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 837 flow [2024-11-19 05:58:38,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:38,527 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 744 flow [2024-11-19 05:58:38,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-19 05:58:38,528 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:38,528 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 744 flow [2024-11-19 05:58:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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-19 05:58:38,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:38,530 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] [2024-11-19 05:58:38,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:58:38,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:38,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2071319894, now seen corresponding path program 1 times [2024-11-19 05:58:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179844526] [2024-11-19 05:58:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:38,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:38,581 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-19 05:58:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:38,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179844526] [2024-11-19 05:58:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179844526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381439045] [2024-11-19 05:58:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:38,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:38,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:38,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:38,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:38,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:38,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:39,283 INFO L124 PetriNetUnfolderBase]: 486/3093 cut-off events. [2024-11-19 05:58:39,283 INFO L125 PetriNetUnfolderBase]: For 209/319 co-relation queries the response was YES. [2024-11-19 05:58:39,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 3093 events. 486/3093 cut-off events. For 209/319 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24185 event pairs, 188 based on Foata normal form. 9/2597 useless extension candidates. Maximal degree in co-relation 3190. Up to 569 conditions per place. [2024-11-19 05:58:39,338 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-19 05:58:39,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 825 flow [2024-11-19 05:58:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-19 05:58:39,341 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-19 05:58:39,342 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 744 flow. Second operand 3 states and 1128 transitions. [2024-11-19 05:58:39,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 825 flow [2024-11-19 05:58:39,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:39,347 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 744 flow [2024-11-19 05:58:39,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-19 05:58:39,348 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:39,348 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 744 flow [2024-11-19 05:58:39,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:39,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:39,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:39,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:58:39,350 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:39,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -894883096, now seen corresponding path program 1 times [2024-11-19 05:58:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:39,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500377302] [2024-11-19 05:58:39,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:39,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:39,390 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-19 05:58:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500377302] [2024-11-19 05:58:39,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500377302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:39,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:39,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119552864] [2024-11-19 05:58:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:39,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:39,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:39,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:39,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:39,403 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:39,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-19 05:58:39,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:39,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:39,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:39,892 INFO L124 PetriNetUnfolderBase]: 406/2971 cut-off events. [2024-11-19 05:58:39,893 INFO L125 PetriNetUnfolderBase]: For 218/296 co-relation queries the response was YES. [2024-11-19 05:58:39,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 2971 events. 406/2971 cut-off events. For 218/296 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 23189 event pairs, 89 based on Foata normal form. 9/2535 useless extension candidates. Maximal degree in co-relation 2949. Up to 299 conditions per place. [2024-11-19 05:58:39,939 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-19 05:58:39,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 852 flow [2024-11-19 05:58:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-19 05:58:39,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-19 05:58:39,942 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 744 flow. Second operand 3 states and 1138 transitions. [2024-11-19 05:58:39,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 852 flow [2024-11-19 05:58:39,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 363 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:39,949 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 748 flow [2024-11-19 05:58:39,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-19 05:58:39,950 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:39,950 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 748 flow [2024-11-19 05:58:39,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-19 05:58:39,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:39,951 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:58:39,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:58:39,951 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:39,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 911133796, now seen corresponding path program 1 times [2024-11-19 05:58:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164978319] [2024-11-19 05:58:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:39,987 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-19 05:58:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:39,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164978319] [2024-11-19 05:58:39,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164978319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:39,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:39,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040376824] [2024-11-19 05:58:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:39,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:40,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:40,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:40,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:40,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:40,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:40,461 INFO L124 PetriNetUnfolderBase]: 528/2947 cut-off events. [2024-11-19 05:58:40,461 INFO L125 PetriNetUnfolderBase]: For 254/390 co-relation queries the response was YES. [2024-11-19 05:58:40,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 2947 events. 528/2947 cut-off events. For 254/390 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22520 event pairs, 215 based on Foata normal form. 10/2465 useless extension candidates. Maximal degree in co-relation 3009. Up to 610 conditions per place. [2024-11-19 05:58:40,514 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-19 05:58:40,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 828 flow [2024-11-19 05:58:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-19 05:58:40,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-19 05:58:40,517 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 748 flow. Second operand 3 states and 1128 transitions. [2024-11-19 05:58:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 828 flow [2024-11-19 05:58:40,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 357 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:40,522 INFO L231 Difference]: Finished difference. Result has 356 places, 349 transitions, 748 flow [2024-11-19 05:58:40,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=349} [2024-11-19 05:58:40,523 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:40,523 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 349 transitions, 748 flow [2024-11-19 05:58:40,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:40,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:40,524 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] [2024-11-19 05:58:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:58:40,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:40,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1204443032, now seen corresponding path program 1 times [2024-11-19 05:58:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932181650] [2024-11-19 05:58:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:40,573 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-19 05:58:40,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:40,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932181650] [2024-11-19 05:58:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932181650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:40,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:40,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112404096] [2024-11-19 05:58:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:40,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:40,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:40,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:40,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:40,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:40,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:40,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:40,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:40,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:41,058 INFO L124 PetriNetUnfolderBase]: 712/3261 cut-off events. [2024-11-19 05:58:41,058 INFO L125 PetriNetUnfolderBase]: For 341/399 co-relation queries the response was YES. [2024-11-19 05:58:41,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 3261 events. 712/3261 cut-off events. For 341/399 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 24931 event pairs, 245 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3441. Up to 744 conditions per place. [2024-11-19 05:58:41,100 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-19 05:58:41,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 834 flow [2024-11-19 05:58:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-19 05:58:41,103 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-19 05:58:41,103 INFO L175 Difference]: Start difference. First operand has 356 places, 349 transitions, 748 flow. Second operand 3 states and 1129 transitions. [2024-11-19 05:58:41,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 834 flow [2024-11-19 05:58:41,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:41,107 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 746 flow [2024-11-19 05:58:41,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-19 05:58:41,108 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-19 05:58:41,108 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 746 flow [2024-11-19 05:58:41,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:41,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:41,109 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] [2024-11-19 05:58:41,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:58:41,109 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:41,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash -605340477, now seen corresponding path program 1 times [2024-11-19 05:58:41,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:41,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503006751] [2024-11-19 05:58:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:41,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:41,142 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-19 05:58:41,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:41,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503006751] [2024-11-19 05:58:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503006751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:41,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:41,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965568686] [2024-11-19 05:58:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:41,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:41,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:41,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:41,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:41,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:41,665 INFO L124 PetriNetUnfolderBase]: 433/3145 cut-off events. [2024-11-19 05:58:41,666 INFO L125 PetriNetUnfolderBase]: For 210/326 co-relation queries the response was YES. [2024-11-19 05:58:41,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3145 events. 433/3145 cut-off events. For 210/326 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24504 event pairs, 105 based on Foata normal form. 10/2700 useless extension candidates. Maximal degree in co-relation 3049. Up to 339 conditions per place. [2024-11-19 05:58:41,695 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-19 05:58:41,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 846 flow [2024-11-19 05:58:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-19 05:58:41,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-19 05:58:41,697 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 746 flow. Second operand 3 states and 1137 transitions. [2024-11-19 05:58:41,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 846 flow [2024-11-19 05:58:41,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 360 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:41,702 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 750 flow [2024-11-19 05:58:41,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-19 05:58:41,702 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-19 05:58:41,703 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 750 flow [2024-11-19 05:58:41,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:41,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:41,703 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] [2024-11-19 05:58:41,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:58:41,704 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1406560618, now seen corresponding path program 1 times [2024-11-19 05:58:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610895670] [2024-11-19 05:58:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:41,738 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-19 05:58:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610895670] [2024-11-19 05:58:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610895670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304539686] [2024-11-19 05:58:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:41,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:41,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:41,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:41,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:41,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:41,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:41,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:42,139 INFO L124 PetriNetUnfolderBase]: 542/3144 cut-off events. [2024-11-19 05:58:42,139 INFO L125 PetriNetUnfolderBase]: For 272/318 co-relation queries the response was YES. [2024-11-19 05:58:42,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 3144 events. 542/3144 cut-off events. For 272/318 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 23785 event pairs, 117 based on Foata normal form. 0/2622 useless extension candidates. Maximal degree in co-relation 3199. Up to 399 conditions per place. [2024-11-19 05:58:42,235 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-19 05:58:42,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 851 flow [2024-11-19 05:58:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:42,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-19 05:58:42,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-19 05:58:42,242 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 750 flow. Second operand 3 states and 1137 transitions. [2024-11-19 05:58:42,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 851 flow [2024-11-19 05:58:42,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:42,257 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 756 flow [2024-11-19 05:58:42,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=348} [2024-11-19 05:58:42,258 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:42,258 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 756 flow [2024-11-19 05:58:42,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:58:42,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:42,263 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-19 05:58:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:58:42,263 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:42,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:42,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1175845953, now seen corresponding path program 1 times [2024-11-19 05:58:42,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:42,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573553281] [2024-11-19 05:58:42,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:42,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:42,338 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-19 05:58:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573553281] [2024-11-19 05:58:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573553281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:42,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095709935] [2024-11-19 05:58:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:42,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-19 05:58:42,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 348 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 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-19 05:58:42,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:42,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-19 05:58:42,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:43,335 INFO L124 PetriNetUnfolderBase]: 821/3691 cut-off events. [2024-11-19 05:58:43,338 INFO L125 PetriNetUnfolderBase]: For 436/461 co-relation queries the response was YES. [2024-11-19 05:58:43,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5078 conditions, 3691 events. 821/3691 cut-off events. For 436/461 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 28606 event pairs, 290 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3607. Up to 836 conditions per place. [2024-11-19 05:58:43,403 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-19 05:58:43,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 841 flow [2024-11-19 05:58:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-19 05:58:43,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-19 05:58:43,407 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 756 flow. Second operand 3 states and 1129 transitions. [2024-11-19 05:58:43,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 841 flow [2024-11-19 05:58:43,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:58:43,423 INFO L231 Difference]: Finished difference. Result has 356 places, 347 transitions, 756 flow [2024-11-19 05:58:43,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=347} [2024-11-19 05:58:43,427 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-19 05:58:43,427 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 756 flow [2024-11-19 05:58:43,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 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-19 05:58:43,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:43,430 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] [2024-11-19 05:58:43,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:58:43,430 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-19 05:58:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash -125379082, now seen corresponding path program 1 times [2024-11-19 05:58:43,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:43,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511612278] [2024-11-19 05:58:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:43,539 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-19 05:58:43,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:43,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511612278] [2024-11-19 05:58:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511612278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149125771] [2024-11-19 05:58:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:43,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:43,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:43,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-19 05:58:43,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 347 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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-19 05:58:43,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:43,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-19 05:58:43,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:44,579 INFO L124 PetriNetUnfolderBase]: 609/3532 cut-off events. [2024-11-19 05:58:44,580 INFO L125 PetriNetUnfolderBase]: For 401/426 co-relation queries the response was YES. [2024-11-19 05:58:44,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 3532 events. 609/3532 cut-off events. For 401/426 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 27041 event pairs, 142 based on Foata normal form. 0/2964 useless extension candidates. Maximal degree in co-relation 3375. Up to 466 conditions per place. [2024-11-19 05:58:44,628 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-11-19 05:58:44,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 853 flow [2024-11-19 05:58:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:44,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-19 05:58:44,632 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-19 05:58:44,632 INFO L175 Difference]: Start difference. First operand has 356 places, 347 transitions, 756 flow. Second operand 3 states and 1136 transitions. [2024-11-19 05:58:44,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 853 flow [2024-11-19 05:58:44,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:44,638 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2024-11-19 05:58:44,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=355, PETRI_TRANSITIONS=0} [2024-11-19 05:58:44,639 INFO L277 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-19 05:58:44,639 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2024-11-19 05:58:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 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-19 05:58:44,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2024-11-19 05:58:44,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-19 05:58:44,644 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-19 05:58:44,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-19 05:58:44,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-19 05:58:44,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-19 05:58:44,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-19 05:58:44,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-19 05:58:44,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 50 remaining) [2024-11-19 05:58:44,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 50 remaining) [2024-11-19 05:58:44,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 50 remaining) [2024-11-19 05:58:44,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 50 remaining) [2024-11-19 05:58:44,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-19 05:58:44,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-19 05:58:44,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-19 05:58:44,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-19 05:58:44,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-19 05:58:44,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-19 05:58:44,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:58:44,652 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:44,657 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:58:44,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:58:44,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:58:44 BasicIcfg [2024-11-19 05:58:44,664 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:58:44,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:58:44,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:58:44,665 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:58:44,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:31" (3/4) ... [2024-11-19 05:58:44,667 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:58:44,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:58:44,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:58:44,671 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:58:44,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 05:58:44,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-19 05:58:44,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-19 05:58:44,677 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 05:58:44,677 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:58:44,677 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:58:44,678 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:58:44,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:58:44,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:58:44,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:58:44,777 INFO L158 Benchmark]: Toolchain (without parser) took 14205.80ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 138.9MB in the beginning and 790.3MB in the end (delta: -651.3MB). Peak memory consumption was 586.4MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,777 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:58:44,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.72ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 129.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.83ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 127.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,778 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,778 INFO L158 Benchmark]: RCFGBuilder took 570.38ms. Allocated memory is still 169.9MB. Free memory was 125.0MB in the beginning and 98.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,779 INFO L158 Benchmark]: TraceAbstraction took 13157.75ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.7MB in the beginning and 796.6MB in the end (delta: -698.8MB). Peak memory consumption was 540.0MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,779 INFO L158 Benchmark]: Witness Printer took 112.14ms. Allocated memory is still 1.4GB. Free memory was 796.6MB in the beginning and 790.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:44,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 127.9MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.72ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 129.2MB in the end (delta: 9.6MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.83ms. Allocated memory is still 169.9MB. Free memory was 129.2MB in the beginning and 127.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.00ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.38ms. Allocated memory is still 169.9MB. Free memory was 125.0MB in the beginning and 98.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13157.75ms. Allocated memory was 169.9MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 97.7MB in the beginning and 796.6MB in the end (delta: -698.8MB). Peak memory consumption was 540.0MB. Max. memory is 16.1GB. * Witness Printer took 112.14ms. Allocated memory is still 1.4GB. Free memory was 796.6MB in the beginning and 790.3MB 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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: 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: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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 13 procedures, 613 locations, 50 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: 12.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 103 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2964 ConstructedInterpolants, 0 QuantifiedInterpolants, 3012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:58:44,814 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