./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.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.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:29,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:29,644 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:29,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:29,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:29,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:29,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:29,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:29,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:29,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:29,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:29,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:29,678 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:29,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:29,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:29,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:29,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:29,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:29,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:29,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:29,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:29,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:29,681 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:29,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:29,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:29,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:29,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:29,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:29,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:29,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:29,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:29,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:29,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:29,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:29,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:29,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:29,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:29,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:29,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:29,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:29,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:29,685 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2024-11-19 05:58:29,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:29,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:29,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:29,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:29,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:29,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-19 05:58:31,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:58:31,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:58:31,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-19 05:58:31,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9c83180/bf234074960440e995d3d0918e59aa6e/FLAG9ac9e6341 [2024-11-19 05:58:31,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9c83180/bf234074960440e995d3d0918e59aa6e [2024-11-19 05:58:31,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:58:31,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:58:31,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:31,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:58:31,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:58:31,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:31" (1/1) ... [2024-11-19 05:58:31,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d7c557d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:31, skipping insertion in model container [2024-11-19 05:58:31,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:58:31" (1/1) ... [2024-11-19 05:58:31,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:58:31,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:31,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:58:31,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:58:31,804 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:58:31,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:31 WrapperNode [2024-11-19 05:58:31,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:58:31,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:31,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:58:31,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:58:31,811 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:31" (1/1) ... [2024-11-19 05:58:31,817 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:31" (1/1) ... [2024-11-19 05:58:31,837 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 276 [2024-11-19 05:58:31,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:58:31,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:58:31,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:58:31,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:58:31,849 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:31" (1/1) ... [2024-11-19 05:58:31,849 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:31" (1/1) ... [2024-11-19 05:58:31,857 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:31" (1/1) ... [2024-11-19 05:58:31,857 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:31" (1/1) ... [2024-11-19 05:58:31,864 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:31" (1/1) ... [2024-11-19 05:58:31,866 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:31" (1/1) ... [2024-11-19 05:58:31,867 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:31" (1/1) ... [2024-11-19 05:58:31,868 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:31" (1/1) ... [2024-11-19 05:58:31,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:58:31,871 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:58:31,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:58:31,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:58:31,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:31" (1/1) ... [2024-11-19 05:58:31,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:58:31,912 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:31,916 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,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:58:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:58:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:58:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:58:31,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:58:31,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:58:31,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:58:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 05:58:31,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 05:58:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:58:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-19 05:58:31,975 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-19 05:58:31,975 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-19 05:58:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-19 05:58:31,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:58:31,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:58:31,978 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:32,099 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:58:32,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:58:32,490 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:58:32,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:58:32,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:58:32,505 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 05:58:32,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:32 BoogieIcfgContainer [2024-11-19 05:58:32,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:58:32,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:58:32,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:58:32,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:58:32,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:58:31" (1/3) ... [2024-11-19 05:58:32,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20054236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:32, skipping insertion in model container [2024-11-19 05:58:32,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:58:31" (2/3) ... [2024-11-19 05:58:32,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20054236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:58:32, skipping insertion in model container [2024-11-19 05:58:32,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:58:32" (3/3) ... [2024-11-19 05:58:32,513 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2024-11-19 05:58:32,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:58:32,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-19 05:58:32,528 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:58:32,631 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-19 05:58:32,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 329 transitions, 724 flow [2024-11-19 05:58:32,835 INFO L124 PetriNetUnfolderBase]: 12/315 cut-off events. [2024-11-19 05:58:32,836 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:58:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 315 events. 12/315 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 566 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2024-11-19 05:58:32,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 329 transitions, 724 flow [2024-11-19 05:58:32,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 298 transitions, 641 flow [2024-11-19 05:58:32,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:58:32,860 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;@75c2a66e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:58:32,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-19 05:58:32,878 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:58:32,879 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2024-11-19 05:58:32,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:58:32,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:32,880 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] [2024-11-19 05:58:32,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 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 -555351477, now seen corresponding path program 1 times [2024-11-19 05:58:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548730788] [2024-11-19 05:58:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,147 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,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548730788] [2024-11-19 05:58:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548730788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298690206] [2024-11-19 05:58:33,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2024-11-19 05:58:33,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2024-11-19 05:58:33,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:33,514 INFO L124 PetriNetUnfolderBase]: 128/1152 cut-off events. [2024-11-19 05:58:33,515 INFO L125 PetriNetUnfolderBase]: For 187/198 co-relation queries the response was YES. [2024-11-19 05:58:33,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 1152 events. 128/1152 cut-off events. For 187/198 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7125 event pairs, 88 based on Foata normal form. 104/1085 useless extension candidates. Maximal degree in co-relation 1465. Up to 215 conditions per place. [2024-11-19 05:58:33,530 INFO L140 encePairwiseOnDemand]: 323/333 looper letters, 22 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2024-11-19 05:58:33,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 290 transitions, 673 flow [2024-11-19 05:58:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:33,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-19 05:58:33,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8998998998998999 [2024-11-19 05:58:33,550 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 641 flow. Second operand 3 states and 899 transitions. [2024-11-19 05:58:33,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 290 transitions, 673 flow [2024-11-19 05:58:33,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 290 transitions, 644 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-19 05:58:33,561 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 598 flow [2024-11-19 05:58:33,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2024-11-19 05:58:33,565 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2024-11-19 05:58:33,565 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 598 flow [2024-11-19 05:58:33,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:33,566 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] [2024-11-19 05:58:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:58:33,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:33,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash -23279243, now seen corresponding path program 1 times [2024-11-19 05:58:33,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105799086] [2024-11-19 05:58:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:33,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:33,660 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,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105799086] [2024-11-19 05:58:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105799086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:33,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:33,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733747460] [2024-11-19 05:58:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:33,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:33,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:33,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:33,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2024-11-19 05:58:33,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:33,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2024-11-19 05:58:33,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:33,903 INFO L124 PetriNetUnfolderBase]: 152/1260 cut-off events. [2024-11-19 05:58:33,904 INFO L125 PetriNetUnfolderBase]: For 61/77 co-relation queries the response was YES. [2024-11-19 05:58:33,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1572 conditions, 1260 events. 152/1260 cut-off events. For 61/77 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7958 event pairs, 88 based on Foata normal form. 0/1050 useless extension candidates. Maximal degree in co-relation 1519. Up to 239 conditions per place. [2024-11-19 05:58:33,918 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-19 05:58:33,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 288 transitions, 644 flow [2024-11-19 05:58:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-11-19 05:58:33,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2024-11-19 05:58:33,922 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 598 flow. Second operand 3 states and 892 transitions. [2024-11-19 05:58:33,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 288 transitions, 644 flow [2024-11-19 05:58:33,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:33,927 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 596 flow [2024-11-19 05:58:33,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2024-11-19 05:58:33,931 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2024-11-19 05:58:33,931 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 596 flow [2024-11-19 05:58:33,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:33,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:33,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:58:33,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:33,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:33,933 INFO L85 PathProgramCache]: Analyzing trace with hash 793117596, now seen corresponding path program 1 times [2024-11-19 05:58:33,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:33,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882694921] [2024-11-19 05:58:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,021 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,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882694921] [2024-11-19 05:58:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882694921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402362211] [2024-11-19 05:58:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2024-11-19 05:58:34,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2024-11-19 05:58:34,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,176 INFO L124 PetriNetUnfolderBase]: 128/927 cut-off events. [2024-11-19 05:58:34,177 INFO L125 PetriNetUnfolderBase]: For 47/53 co-relation queries the response was YES. [2024-11-19 05:58:34,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 927 events. 128/927 cut-off events. For 47/53 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5267 event pairs, 88 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 1162. Up to 215 conditions per place. [2024-11-19 05:58:34,185 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-19 05:58:34,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 287 transitions, 642 flow [2024-11-19 05:58:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-11-19 05:58:34,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2024-11-19 05:58:34,188 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 596 flow. Second operand 3 states and 892 transitions. [2024-11-19 05:58:34,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 287 transitions, 642 flow [2024-11-19 05:58:34,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,192 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 594 flow [2024-11-19 05:58:34,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2024-11-19 05:58:34,193 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2024-11-19 05:58:34,193 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 594 flow [2024-11-19 05:58:34,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,194 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,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:58:34,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,195 INFO L85 PathProgramCache]: Analyzing trace with hash -504514342, now seen corresponding path program 1 times [2024-11-19 05:58:34,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556052010] [2024-11-19 05:58:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:58:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556052010] [2024-11-19 05:58:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556052010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347723216] [2024-11-19 05:58:34,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 333 [2024-11-19 05:58:34,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 333 [2024-11-19 05:58:34,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,416 INFO L124 PetriNetUnfolderBase]: 152/950 cut-off events. [2024-11-19 05:58:34,417 INFO L125 PetriNetUnfolderBase]: For 76/86 co-relation queries the response was YES. [2024-11-19 05:58:34,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 950 events. 152/950 cut-off events. For 76/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5107 event pairs, 88 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1161. Up to 239 conditions per place. [2024-11-19 05:58:34,427 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 22 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-19 05:58:34,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 640 flow [2024-11-19 05:58:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-11-19 05:58:34,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8928928928928929 [2024-11-19 05:58:34,429 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 594 flow. Second operand 3 states and 892 transitions. [2024-11-19 05:58:34,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 640 flow [2024-11-19 05:58:34,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,433 INFO L231 Difference]: Finished difference. Result has 292 places, 286 transitions, 592 flow [2024-11-19 05:58:34,433 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=292, PETRI_TRANSITIONS=286} [2024-11-19 05:58:34,434 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2024-11-19 05:58:34,434 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 286 transitions, 592 flow [2024-11-19 05:58:34,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 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,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:58:34,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -791440260, now seen corresponding path program 1 times [2024-11-19 05:58:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336114609] [2024-11-19 05:58:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,517 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,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336114609] [2024-11-19 05:58:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336114609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909760485] [2024-11-19 05:58:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:34,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 286 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:34,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:34,702 INFO L124 PetriNetUnfolderBase]: 188/1432 cut-off events. [2024-11-19 05:58:34,702 INFO L125 PetriNetUnfolderBase]: For 53/101 co-relation queries the response was YES. [2024-11-19 05:58:34,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 1432 events. 188/1432 cut-off events. For 53/101 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9469 event pairs, 86 based on Foata normal form. 6/1208 useless extension candidates. Maximal degree in co-relation 1785. Up to 245 conditions per place. [2024-11-19 05:58:34,718 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-19 05:58:34,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 677 flow [2024-11-19 05:58:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:34,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:34,722 INFO L175 Difference]: Start difference. First operand has 292 places, 286 transitions, 592 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:34,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 677 flow [2024-11-19 05:58:34,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 293 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:34,726 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 590 flow [2024-11-19 05:58:34,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2024-11-19 05:58:34,727 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -15 predicate places. [2024-11-19 05:58:34,727 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 590 flow [2024-11-19 05:58:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:34,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:34,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:58:34,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1574384374, now seen corresponding path program 1 times [2024-11-19 05:58:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062714664] [2024-11-19 05:58:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:34,802 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,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:34,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062714664] [2024-11-19 05:58:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062714664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616173334] [2024-11-19 05:58:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:34,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:34,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:34,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:34,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:34,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,042 INFO L124 PetriNetUnfolderBase]: 168/1075 cut-off events. [2024-11-19 05:58:35,043 INFO L125 PetriNetUnfolderBase]: For 54/69 co-relation queries the response was YES. [2024-11-19 05:58:35,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 1075 events. 168/1075 cut-off events. For 54/69 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6514 event pairs, 42 based on Foata normal form. 0/933 useless extension candidates. Maximal degree in co-relation 560. Up to 177 conditions per place. [2024-11-19 05:58:35,070 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-11-19 05:58:35,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 291 transitions, 671 flow [2024-11-19 05:58:35,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:35,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:35,075 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 590 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:35,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 291 transitions, 671 flow [2024-11-19 05:58:35,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,086 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 588 flow [2024-11-19 05:58:35,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2024-11-19 05:58:35,087 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2024-11-19 05:58:35,087 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 588 flow [2024-11-19 05:58:35,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 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,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:35,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:58:35,088 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:35,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash 585683060, now seen corresponding path program 1 times [2024-11-19 05:58:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491012745] [2024-11-19 05:58:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,156 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,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491012745] [2024-11-19 05:58:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491012745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161424114] [2024-11-19 05:58:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:35,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:35,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,335 INFO L124 PetriNetUnfolderBase]: 188/1215 cut-off events. [2024-11-19 05:58:35,336 INFO L125 PetriNetUnfolderBase]: For 70/113 co-relation queries the response was YES. [2024-11-19 05:58:35,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 1215 events. 188/1215 cut-off events. For 70/113 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7441 event pairs, 86 based on Foata normal form. 6/1039 useless extension candidates. Maximal degree in co-relation 1232. Up to 245 conditions per place. [2024-11-19 05:58:35,350 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-19 05:58:35,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 290 transitions, 672 flow [2024-11-19 05:58:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:35,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:35,352 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 588 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:35,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 290 transitions, 672 flow [2024-11-19 05:58:35,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 290 transitions, 666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,356 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 584 flow [2024-11-19 05:58:35,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-19 05:58:35,357 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -18 predicate places. [2024-11-19 05:58:35,358 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 584 flow [2024-11-19 05:58:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:58:35,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:35,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 2141630952, now seen corresponding path program 1 times [2024-11-19 05:58:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010896455] [2024-11-19 05:58:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,420 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,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010896455] [2024-11-19 05:58:35,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010896455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660752952] [2024-11-19 05:58:35,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:35,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:35,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,584 INFO L124 PetriNetUnfolderBase]: 230/1189 cut-off events. [2024-11-19 05:58:35,584 INFO L125 PetriNetUnfolderBase]: For 94/110 co-relation queries the response was YES. [2024-11-19 05:58:35,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 1189 events. 230/1189 cut-off events. For 94/110 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 7384 event pairs, 86 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1093. Up to 275 conditions per place. [2024-11-19 05:58:35,598 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 30 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-19 05:58:35,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 290 transitions, 674 flow [2024-11-19 05:58:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2024-11-19 05:58:35,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-19 05:58:35,601 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 584 flow. Second operand 3 states and 906 transitions. [2024-11-19 05:58:35,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 290 transitions, 674 flow [2024-11-19 05:58:35,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 290 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,605 INFO L231 Difference]: Finished difference. Result has 287 places, 281 transitions, 582 flow [2024-11-19 05:58:35,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=287, PETRI_TRANSITIONS=281} [2024-11-19 05:58:35,606 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -19 predicate places. [2024-11-19 05:58:35,606 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 281 transitions, 582 flow [2024-11-19 05:58:35,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,607 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:35,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:58:35,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:35,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1927689465, now seen corresponding path program 1 times [2024-11-19 05:58:35,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056259335] [2024-11-19 05:58:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,639 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,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056259335] [2024-11-19 05:58:35,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056259335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462564444] [2024-11-19 05:58:35,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:35,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 281 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:35,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:35,798 INFO L124 PetriNetUnfolderBase]: 168/966 cut-off events. [2024-11-19 05:58:35,799 INFO L125 PetriNetUnfolderBase]: For 58/64 co-relation queries the response was YES. [2024-11-19 05:58:35,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 966 events. 168/966 cut-off events. For 58/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5495 event pairs, 46 based on Foata normal form. 1/850 useless extension candidates. Maximal degree in co-relation 960. Up to 166 conditions per place. [2024-11-19 05:58:35,805 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 27 selfloop transitions, 3 changer transitions 0/287 dead transitions. [2024-11-19 05:58:35,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 287 transitions, 662 flow [2024-11-19 05:58:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:35,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:35,808 INFO L175 Difference]: Start difference. First operand has 287 places, 281 transitions, 582 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:35,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 287 transitions, 662 flow [2024-11-19 05:58:35,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:35,812 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 580 flow [2024-11-19 05:58:35,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2024-11-19 05:58:35,813 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -21 predicate places. [2024-11-19 05:58:35,813 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 580 flow [2024-11-19 05:58:35,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:35,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:35,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:58:35,814 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:35,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -410744278, now seen corresponding path program 1 times [2024-11-19 05:58:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:35,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60976339] [2024-11-19 05:58:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:35,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:35,856 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,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:35,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60976339] [2024-11-19 05:58:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60976339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580482444] [2024-11-19 05:58:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:35,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:35,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:35,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:35,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,010 INFO L124 PetriNetUnfolderBase]: 204/1211 cut-off events. [2024-11-19 05:58:36,010 INFO L125 PetriNetUnfolderBase]: For 82/102 co-relation queries the response was YES. [2024-11-19 05:58:36,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1211 events. 204/1211 cut-off events. For 82/102 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7378 event pairs, 59 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1124. Up to 182 conditions per place. [2024-11-19 05:58:36,021 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 28 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2024-11-19 05:58:36,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 286 transitions, 666 flow [2024-11-19 05:58:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2024-11-19 05:58:36,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-19 05:58:36,023 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 580 flow. Second operand 3 states and 906 transitions. [2024-11-19 05:58:36,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 286 transitions, 666 flow [2024-11-19 05:58:36,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 286 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,027 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 576 flow [2024-11-19 05:58:36,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2024-11-19 05:58:36,028 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -23 predicate places. [2024-11-19 05:58:36,028 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 576 flow [2024-11-19 05:58:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 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,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,029 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] [2024-11-19 05:58:36,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:58:36,029 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2001891337, now seen corresponding path program 1 times [2024-11-19 05:58:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651326861] [2024-11-19 05:58:36,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,059 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,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651326861] [2024-11-19 05:58:36,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651326861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320270891] [2024-11-19 05:58:36,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:36,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,202 INFO L124 PetriNetUnfolderBase]: 230/1008 cut-off events. [2024-11-19 05:58:36,202 INFO L125 PetriNetUnfolderBase]: For 112/122 co-relation queries the response was YES. [2024-11-19 05:58:36,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 1008 events. 230/1008 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5531 event pairs, 104 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1039. Up to 275 conditions per place. [2024-11-19 05:58:36,209 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 30 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-11-19 05:58:36,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 285 transitions, 665 flow [2024-11-19 05:58:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2024-11-19 05:58:36,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-19 05:58:36,211 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 576 flow. Second operand 3 states and 906 transitions. [2024-11-19 05:58:36,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 285 transitions, 665 flow [2024-11-19 05:58:36,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 285 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,214 INFO L231 Difference]: Finished difference. Result has 282 places, 276 transitions, 572 flow [2024-11-19 05:58:36,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=276} [2024-11-19 05:58:36,215 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -24 predicate places. [2024-11-19 05:58:36,216 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 572 flow [2024-11-19 05:58:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:58:36,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1571888822, now seen corresponding path program 1 times [2024-11-19 05:58:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82959129] [2024-11-19 05:58:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,248 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,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82959129] [2024-11-19 05:58:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82959129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143875330] [2024-11-19 05:58:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:36,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:36,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,375 INFO L124 PetriNetUnfolderBase]: 204/985 cut-off events. [2024-11-19 05:58:36,375 INFO L125 PetriNetUnfolderBase]: For 112/122 co-relation queries the response was YES. [2024-11-19 05:58:36,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 985 events. 204/985 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5382 event pairs, 51 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 606. Up to 171 conditions per place. [2024-11-19 05:58:36,385 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 28 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2024-11-19 05:58:36,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 283 transitions, 657 flow [2024-11-19 05:58:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2024-11-19 05:58:36,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-19 05:58:36,387 INFO L175 Difference]: Start difference. First operand has 282 places, 276 transitions, 572 flow. Second operand 3 states and 906 transitions. [2024-11-19 05:58:36,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 283 transitions, 657 flow [2024-11-19 05:58:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 283 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,391 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 570 flow [2024-11-19 05:58:36,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2024-11-19 05:58:36,392 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -26 predicate places. [2024-11-19 05:58:36,392 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 570 flow [2024-11-19 05:58:36,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:36,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:58:36,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1394444034, now seen corresponding path program 1 times [2024-11-19 05:58:36,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301888042] [2024-11-19 05:58:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,423 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,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301888042] [2024-11-19 05:58:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301888042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345687659] [2024-11-19 05:58:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:36,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:36,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,569 INFO L124 PetriNetUnfolderBase]: 188/1090 cut-off events. [2024-11-19 05:58:36,570 INFO L125 PetriNetUnfolderBase]: For 45/62 co-relation queries the response was YES. [2024-11-19 05:58:36,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1552 conditions, 1090 events. 188/1090 cut-off events. For 45/62 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6549 event pairs, 104 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1219. Up to 245 conditions per place. [2024-11-19 05:58:36,578 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-19 05:58:36,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 281 transitions, 655 flow [2024-11-19 05:58:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:36,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:36,580 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 570 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 281 transitions, 655 flow [2024-11-19 05:58:36,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,583 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 566 flow [2024-11-19 05:58:36,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2024-11-19 05:58:36,584 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -27 predicate places. [2024-11-19 05:58:36,585 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 566 flow [2024-11-19 05:58:36,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 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,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,585 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:36,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:58:36,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash 71281345, now seen corresponding path program 1 times [2024-11-19 05:58:36,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790050584] [2024-11-19 05:58:36,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,615 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,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790050584] [2024-11-19 05:58:36,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790050584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656267589] [2024-11-19 05:58:36,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:36,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:36,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,736 INFO L124 PetriNetUnfolderBase]: 188/930 cut-off events. [2024-11-19 05:58:36,736 INFO L125 PetriNetUnfolderBase]: For 65/71 co-relation queries the response was YES. [2024-11-19 05:58:36,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 930 events. 188/930 cut-off events. For 65/71 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5205 event pairs, 104 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 992. Up to 245 conditions per place. [2024-11-19 05:58:36,745 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 29 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-11-19 05:58:36,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 650 flow [2024-11-19 05:58:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-19 05:58:36,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9059059059059059 [2024-11-19 05:58:36,747 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 566 flow. Second operand 3 states and 905 transitions. [2024-11-19 05:58:36,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 650 flow [2024-11-19 05:58:36,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 280 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,751 INFO L231 Difference]: Finished difference. Result has 278 places, 272 transitions, 564 flow [2024-11-19 05:58:36,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=278, PETRI_TRANSITIONS=272} [2024-11-19 05:58:36,752 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -28 predicate places. [2024-11-19 05:58:36,752 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 272 transitions, 564 flow [2024-11-19 05:58:36,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,752 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:36,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:58:36,753 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1966884302, now seen corresponding path program 1 times [2024-11-19 05:58:36,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273114890] [2024-11-19 05:58:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,781 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,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273114890] [2024-11-19 05:58:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273114890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112200791] [2024-11-19 05:58:36,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:36,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:36,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:36,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:36,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:36,943 INFO L124 PetriNetUnfolderBase]: 230/1204 cut-off events. [2024-11-19 05:58:36,944 INFO L125 PetriNetUnfolderBase]: For 92/114 co-relation queries the response was YES. [2024-11-19 05:58:36,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1204 events. 230/1204 cut-off events. For 92/114 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7644 event pairs, 104 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 1225. Up to 275 conditions per place. [2024-11-19 05:58:36,952 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 26 selfloop transitions, 2 changer transitions 6/280 dead transitions. [2024-11-19 05:58:36,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 654 flow [2024-11-19 05:58:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 906 transitions. [2024-11-19 05:58:36,954 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9069069069069069 [2024-11-19 05:58:36,954 INFO L175 Difference]: Start difference. First operand has 278 places, 272 transitions, 564 flow. Second operand 3 states and 906 transitions. [2024-11-19 05:58:36,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 654 flow [2024-11-19 05:58:36,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 280 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:36,957 INFO L231 Difference]: Finished difference. Result has 277 places, 267 transitions, 552 flow [2024-11-19 05:58:36,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=277, PETRI_TRANSITIONS=267} [2024-11-19 05:58:36,958 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -29 predicate places. [2024-11-19 05:58:36,958 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 267 transitions, 552 flow [2024-11-19 05:58:36,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 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,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:58:36,959 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] [2024-11-19 05:58:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:58:36,959 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-19 05:58:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:58:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -577636098, now seen corresponding path program 1 times [2024-11-19 05:58:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:58:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007150921] [2024-11-19 05:58:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:58:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:58:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:58:36,991 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,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:58:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007150921] [2024-11-19 05:58:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007150921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:58:36,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:58:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:58:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631704393] [2024-11-19 05:58:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:58:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:58:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:58:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:58:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:58:37,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 333 [2024-11-19 05:58:37,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 267 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 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,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:58:37,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 333 [2024-11-19 05:58:37,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:58:37,112 INFO L124 PetriNetUnfolderBase]: 217/937 cut-off events. [2024-11-19 05:58:37,112 INFO L125 PetriNetUnfolderBase]: For 103/113 co-relation queries the response was YES. [2024-11-19 05:58:37,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 937 events. 217/937 cut-off events. For 103/113 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5124 event pairs, 99 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 985. Up to 256 conditions per place. [2024-11-19 05:58:37,118 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 0 selfloop transitions, 0 changer transitions 275/275 dead transitions. [2024-11-19 05:58:37,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 275 transitions, 637 flow [2024-11-19 05:58:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:58:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:58:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2024-11-19 05:58:37,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9049049049049049 [2024-11-19 05:58:37,120 INFO L175 Difference]: Start difference. First operand has 277 places, 267 transitions, 552 flow. Second operand 3 states and 904 transitions. [2024-11-19 05:58:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 275 transitions, 637 flow [2024-11-19 05:58:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:58:37,123 INFO L231 Difference]: Finished difference. Result has 273 places, 0 transitions, 0 flow [2024-11-19 05:58:37,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=273, PETRI_TRANSITIONS=0} [2024-11-19 05:58:37,123 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -33 predicate places. [2024-11-19 05:58:37,123 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 0 transitions, 0 flow [2024-11-19 05:58:37,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 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,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-19 05:58:37,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-19 05:58:37,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2024-11-19 05:58:37,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-19 05:58:37,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-19 05:58:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-19 05:58:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:58:37,131 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:58:37,136 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:58:37,136 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:58:37,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:58:37 BasicIcfg [2024-11-19 05:58:37,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:58:37,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:58:37,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:58:37,148 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:58:37,148 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:32" (3/4) ... [2024-11-19 05:58:37,150 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:58:37,155 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:58:37,156 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:58:37,156 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:58:37,156 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 05:58:37,156 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-19 05:58:37,156 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-19 05:58:37,159 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-19 05:58:37,159 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:58:37,160 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:58:37,160 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:58:37,224 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:58:37,225 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:58:37,225 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:58:37,225 INFO L158 Benchmark]: Toolchain (without parser) took 5738.35ms. Allocated memory was 130.0MB in the beginning and 331.4MB in the end (delta: 201.3MB). Free memory was 61.1MB in the beginning and 139.4MB in the end (delta: -78.3MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,225 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:58:37,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.90ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 61.0MB in the beginning and 156.5MB in the end (delta: -95.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.16ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,226 INFO L158 Benchmark]: Boogie Preprocessor took 31.99ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,226 INFO L158 Benchmark]: RCFGBuilder took 634.73ms. Allocated memory is still 192.9MB. Free memory was 152.3MB in the beginning and 127.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,227 INFO L158 Benchmark]: TraceAbstraction took 4640.33ms. Allocated memory was 192.9MB in the beginning and 331.4MB in the end (delta: 138.4MB). Free memory was 127.1MB in the beginning and 145.7MB in the end (delta: -18.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,227 INFO L158 Benchmark]: Witness Printer took 76.79ms. Allocated memory is still 331.4MB. Free memory was 145.7MB in the beginning and 139.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:58:37,228 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.16ms. Allocated memory is still 130.0MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.90ms. Allocated memory was 130.0MB in the beginning and 192.9MB in the end (delta: 62.9MB). Free memory was 61.0MB in the beginning and 156.5MB in the end (delta: -95.5MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.16ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 154.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.99ms. Allocated memory is still 192.9MB. Free memory was 154.4MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.73ms. Allocated memory is still 192.9MB. Free memory was 152.3MB in the beginning and 127.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4640.33ms. Allocated memory was 192.9MB in the beginning and 331.4MB in the end (delta: 138.4MB). Free memory was 127.1MB in the beginning and 145.7MB in the end (delta: -18.6MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 76.79ms. Allocated memory is still 331.4MB. Free memory was 145.7MB in the beginning and 139.4MB 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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, 502 locations, 46 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: 4.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 580 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 964 IncrementalHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 92 mSDtfsCounter, 964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:58:37,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE