./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:08,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:08,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:08,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:08,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:08,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:08,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:08,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:08,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:08,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:08,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:08,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:08,846 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:08,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:08,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:08,847 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:08,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:08,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:08,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:08,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:08,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:08,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:08,851 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:08,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:08,852 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:08,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:08,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:08,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:08,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:08,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:08,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:08,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:08,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:08,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:08,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:08,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:08,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:08,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:08,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:08,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:08,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:08,856 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2024-11-10 14:40:09,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:09,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:09,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:09,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:09,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:09,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-11-10 14:40:10,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:10,802 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:10,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-11-10 14:40:10,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b2bc18a/a0813b03cf9b43938e88236a86b6a9b0/FLAGc37886663 [2024-11-10 14:40:10,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b2bc18a/a0813b03cf9b43938e88236a86b6a9b0 [2024-11-10 14:40:10,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:10,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:10,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:10,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:10,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:10,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1609f1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10, skipping insertion in model container [2024-11-10 14:40:10,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:11,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:11,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:11,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:11,115 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:11,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11 WrapperNode [2024-11-10 14:40:11,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:11,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:11,116 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:11,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:11,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,176 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 406 [2024-11-10 14:40:11,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:11,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:11,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:11,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:11,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:11,223 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:11,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:11,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:11,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (1/1) ... [2024-11-10 14:40:11,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:11,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:11,269 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-10 14:40:11,276 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-10 14:40:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:40:11,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:40:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:40:11,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:40:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:11,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:40:11,330 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:40:11,484 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:11,486 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:12,237 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:12,238 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:12,527 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:12,528 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:12,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:12 BoogieIcfgContainer [2024-11-10 14:40:12,528 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:12,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:12,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:12,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:12,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:10" (1/3) ... [2024-11-10 14:40:12,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486113d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:12, skipping insertion in model container [2024-11-10 14:40:12,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:11" (2/3) ... [2024-11-10 14:40:12,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486113d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:12, skipping insertion in model container [2024-11-10 14:40:12,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:12" (3/3) ... [2024-11-10 14:40:12,539 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-11-10 14:40:12,556 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:12,557 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-11-10 14:40:12,557 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:12,666 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:40:12,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 328 transitions, 670 flow [2024-11-10 14:40:12,825 INFO L124 PetriNetUnfolderBase]: 13/326 cut-off events. [2024-11-10 14:40:12,826 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:40:12,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 326 events. 13/326 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 530 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 256. Up to 2 conditions per place. [2024-11-10 14:40:12,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 328 transitions, 670 flow [2024-11-10 14:40:12,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 309 transitions, 630 flow [2024-11-10 14:40:12,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:12,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;@4a9adfd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:12,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2024-11-10 14:40:12,868 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:12,868 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-11-10 14:40:12,869 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:12,869 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,870 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] [2024-11-10 14:40:12,870 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,876 INFO L85 PathProgramCache]: Analyzing trace with hash -342999190, now seen corresponding path program 1 times [2024-11-10 14:40:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724916630] [2024-11-10 14:40:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,165 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-10 14:40:13,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724916630] [2024-11-10 14:40:13,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724916630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499420696] [2024-11-10 14:40:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 328 [2024-11-10 14:40:13,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 309 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-10 14:40:13,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 328 [2024-11-10 14:40:13,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,416 INFO L124 PetriNetUnfolderBase]: 27/414 cut-off events. [2024-11-10 14:40:13,416 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-10 14:40:13,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 414 events. 27/414 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1106 event pairs, 15 based on Foata normal form. 23/375 useless extension candidates. Maximal degree in co-relation 237. Up to 52 conditions per place. [2024-11-10 14:40:13,422 INFO L140 encePairwiseOnDemand]: 277/328 looper letters, 13 selfloop transitions, 2 changer transitions 4/260 dead transitions. [2024-11-10 14:40:13,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 260 transitions, 562 flow [2024-11-10 14:40:13,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2024-11-10 14:40:13,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607723577235772 [2024-11-10 14:40:13,445 INFO L175 Difference]: Start difference. First operand has 304 places, 309 transitions, 630 flow. Second operand 3 states and 847 transitions. [2024-11-10 14:40:13,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 260 transitions, 562 flow [2024-11-10 14:40:13,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 260 transitions, 554 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:40:13,457 INFO L231 Difference]: Finished difference. Result has 261 places, 256 transitions, 520 flow [2024-11-10 14:40:13,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=261, PETRI_TRANSITIONS=256} [2024-11-10 14:40:13,463 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -43 predicate places. [2024-11-10 14:40:13,464 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 256 transitions, 520 flow [2024-11-10 14:40:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-10 14:40:13,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:13,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:13,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:13,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1843741911, now seen corresponding path program 1 times [2024-11-10 14:40:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866212969] [2024-11-10 14:40:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,546 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-10 14:40:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866212969] [2024-11-10 14:40:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866212969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752118246] [2024-11-10 14:40:13,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:13,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 256 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:13,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:13,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,646 INFO L124 PetriNetUnfolderBase]: 22/388 cut-off events. [2024-11-10 14:40:13,646 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-10 14:40:13,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 388 events. 22/388 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 890 event pairs, 8 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 401. Up to 38 conditions per place. [2024-11-10 14:40:13,650 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 12 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-11-10 14:40:13,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 255 transitions, 546 flow [2024-11-10 14:40:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-10 14:40:13,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140243902439024 [2024-11-10 14:40:13,656 INFO L175 Difference]: Start difference. First operand has 261 places, 256 transitions, 520 flow. Second operand 3 states and 801 transitions. [2024-11-10 14:40:13,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 255 transitions, 546 flow [2024-11-10 14:40:13,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 255 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,664 INFO L231 Difference]: Finished difference. Result has 256 places, 255 transitions, 518 flow [2024-11-10 14:40:13,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=256, PETRI_TRANSITIONS=255} [2024-11-10 14:40:13,665 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -48 predicate places. [2024-11-10 14:40:13,665 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 255 transitions, 518 flow [2024-11-10 14:40:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:13,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:13,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:13,666 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 247373646, now seen corresponding path program 1 times [2024-11-10 14:40:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786591314] [2024-11-10 14:40:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,721 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-10 14:40:13,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786591314] [2024-11-10 14:40:13,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786591314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19200403] [2024-11-10 14:40:13,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:13,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:13,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:13,821 INFO L124 PetriNetUnfolderBase]: 22/387 cut-off events. [2024-11-10 14:40:13,822 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-10 14:40:13,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 387 events. 22/387 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 883 event pairs, 8 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 392. Up to 38 conditions per place. [2024-11-10 14:40:13,824 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 12 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-11-10 14:40:13,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 254 transitions, 544 flow [2024-11-10 14:40:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-10 14:40:13,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140243902439024 [2024-11-10 14:40:13,827 INFO L175 Difference]: Start difference. First operand has 256 places, 255 transitions, 518 flow. Second operand 3 states and 801 transitions. [2024-11-10 14:40:13,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 254 transitions, 544 flow [2024-11-10 14:40:13,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 254 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:13,832 INFO L231 Difference]: Finished difference. Result has 255 places, 254 transitions, 516 flow [2024-11-10 14:40:13,832 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=255, PETRI_TRANSITIONS=254} [2024-11-10 14:40:13,833 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -49 predicate places. [2024-11-10 14:40:13,833 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 516 flow [2024-11-10 14:40:13,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:13,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:13,834 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] [2024-11-10 14:40:13,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:13,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:13,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:13,835 INFO L85 PathProgramCache]: Analyzing trace with hash -72757288, now seen corresponding path program 1 times [2024-11-10 14:40:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969643823] [2024-11-10 14:40:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:13,921 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-10 14:40:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969643823] [2024-11-10 14:40:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969643823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593566019] [2024-11-10 14:40:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:13,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:13,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 254 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:13,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:13,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:13,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,018 INFO L124 PetriNetUnfolderBase]: 22/386 cut-off events. [2024-11-10 14:40:14,018 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-10 14:40:14,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 386 events. 22/386 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 881 event pairs, 8 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 383. Up to 38 conditions per place. [2024-11-10 14:40:14,022 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 12 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-11-10 14:40:14,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 253 transitions, 542 flow [2024-11-10 14:40:14,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-10 14:40:14,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140243902439024 [2024-11-10 14:40:14,024 INFO L175 Difference]: Start difference. First operand has 255 places, 254 transitions, 516 flow. Second operand 3 states and 801 transitions. [2024-11-10 14:40:14,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 253 transitions, 542 flow [2024-11-10 14:40:14,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:14,030 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 514 flow [2024-11-10 14:40:14,030 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2024-11-10 14:40:14,031 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -50 predicate places. [2024-11-10 14:40:14,031 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 514 flow [2024-11-10 14:40:14,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:14,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,032 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] [2024-11-10 14:40:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:14,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1907989025, now seen corresponding path program 1 times [2024-11-10 14:40:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347641915] [2024-11-10 14:40:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,085 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-10 14:40:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347641915] [2024-11-10 14:40:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347641915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388082458] [2024-11-10 14:40:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 328 [2024-11-10 14:40:14,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:14,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 328 [2024-11-10 14:40:14,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,179 INFO L124 PetriNetUnfolderBase]: 23/410 cut-off events. [2024-11-10 14:40:14,180 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:40:14,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 410 events. 23/410 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1102 event pairs, 5 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 407. Up to 26 conditions per place. [2024-11-10 14:40:14,182 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2024-11-10 14:40:14,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 259 transitions, 565 flow [2024-11-10 14:40:14,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2024-11-10 14:40:14,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8302845528455285 [2024-11-10 14:40:14,185 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 514 flow. Second operand 3 states and 817 transitions. [2024-11-10 14:40:14,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 259 transitions, 565 flow [2024-11-10 14:40:14,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:14,190 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 518 flow [2024-11-10 14:40:14,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2024-11-10 14:40:14,191 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -50 predicate places. [2024-11-10 14:40:14,192 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 518 flow [2024-11-10 14:40:14,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:14,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,193 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] [2024-11-10 14:40:14,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:14,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1797922988, now seen corresponding path program 1 times [2024-11-10 14:40:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138322280] [2024-11-10 14:40:14,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,238 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-10 14:40:14,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138322280] [2024-11-10 14:40:14,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138322280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612632621] [2024-11-10 14:40:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 328 [2024-11-10 14:40:14,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:14,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 328 [2024-11-10 14:40:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,326 INFO L124 PetriNetUnfolderBase]: 27/455 cut-off events. [2024-11-10 14:40:14,326 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-10 14:40:14,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 455 events. 27/455 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1223 event pairs, 13 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 268. Up to 51 conditions per place. [2024-11-10 14:40:14,329 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 12 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-11-10 14:40:14,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 544 flow [2024-11-10 14:40:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:14,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:14,331 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 518 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:14,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 544 flow [2024-11-10 14:40:14,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 252 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:14,336 INFO L231 Difference]: Finished difference. Result has 254 places, 252 transitions, 518 flow [2024-11-10 14:40:14,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=254, PETRI_TRANSITIONS=252} [2024-11-10 14:40:14,337 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -50 predicate places. [2024-11-10 14:40:14,338 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 252 transitions, 518 flow [2024-11-10 14:40:14,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:14,338 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,339 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:14,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:14,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -539091618, now seen corresponding path program 1 times [2024-11-10 14:40:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006054214] [2024-11-10 14:40:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,402 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-10 14:40:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006054214] [2024-11-10 14:40:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006054214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922680229] [2024-11-10 14:40:14,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:14,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 252 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:14,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:14,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,510 INFO L124 PetriNetUnfolderBase]: 27/454 cut-off events. [2024-11-10 14:40:14,511 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-10 14:40:14,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 454 events. 27/454 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1219 event pairs, 13 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 459. Up to 52 conditions per place. [2024-11-10 14:40:14,513 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 13 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-11-10 14:40:14,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 251 transitions, 546 flow [2024-11-10 14:40:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-10 14:40:14,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140243902439024 [2024-11-10 14:40:14,516 INFO L175 Difference]: Start difference. First operand has 254 places, 252 transitions, 518 flow. Second operand 3 states and 801 transitions. [2024-11-10 14:40:14,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 251 transitions, 546 flow [2024-11-10 14:40:14,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 251 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:14,520 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 516 flow [2024-11-10 14:40:14,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2024-11-10 14:40:14,521 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -51 predicate places. [2024-11-10 14:40:14,521 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 516 flow [2024-11-10 14:40:14,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-10 14:40:14,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,522 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] [2024-11-10 14:40:14,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:14,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1618650692, now seen corresponding path program 1 times [2024-11-10 14:40:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194033002] [2024-11-10 14:40:14,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,556 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-10 14:40:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194033002] [2024-11-10 14:40:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194033002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201567149] [2024-11-10 14:40:14,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 328 [2024-11-10 14:40:14,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:14,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 328 [2024-11-10 14:40:14,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,674 INFO L124 PetriNetUnfolderBase]: 31/497 cut-off events. [2024-11-10 14:40:14,674 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-10 14:40:14,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 497 events. 31/497 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1580 event pairs, 8 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 507. Up to 34 conditions per place. [2024-11-10 14:40:14,677 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 17 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-11-10 14:40:14,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 257 transitions, 572 flow [2024-11-10 14:40:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2024-11-10 14:40:14,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292682926829268 [2024-11-10 14:40:14,680 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 516 flow. Second operand 3 states and 816 transitions. [2024-11-10 14:40:14,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 257 transitions, 572 flow [2024-11-10 14:40:14,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 257 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:14,685 INFO L231 Difference]: Finished difference. Result has 253 places, 251 transitions, 520 flow [2024-11-10 14:40:14,686 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=253, PETRI_TRANSITIONS=251} [2024-11-10 14:40:14,686 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -51 predicate places. [2024-11-10 14:40:14,686 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 251 transitions, 520 flow [2024-11-10 14:40:14,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:14,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,687 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] [2024-11-10 14:40:14,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:14,688 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1141597008, now seen corresponding path program 1 times [2024-11-10 14:40:14,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939434716] [2024-11-10 14:40:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,727 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-10 14:40:14,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939434716] [2024-11-10 14:40:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939434716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582033399] [2024-11-10 14:40:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 328 [2024-11-10 14:40:14,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 251 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:14,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 328 [2024-11-10 14:40:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,840 INFO L124 PetriNetUnfolderBase]: 31/496 cut-off events. [2024-11-10 14:40:14,840 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2024-11-10 14:40:14,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 496 events. 31/496 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1592 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 314. Up to 65 conditions per place. [2024-11-10 14:40:14,842 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 13 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-11-10 14:40:14,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 250 transitions, 548 flow [2024-11-10 14:40:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:14,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:14,846 INFO L175 Difference]: Start difference. First operand has 253 places, 251 transitions, 520 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:14,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 250 transitions, 548 flow [2024-11-10 14:40:14,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 250 transitions, 546 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:14,851 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 520 flow [2024-11-10 14:40:14,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2024-11-10 14:40:14,852 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -51 predicate places. [2024-11-10 14:40:14,853 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 520 flow [2024-11-10 14:40:14,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:14,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:14,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:14,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:14,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:14,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1764450530, now seen corresponding path program 1 times [2024-11-10 14:40:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:14,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202643116] [2024-11-10 14:40:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:14,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:14,897 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-10 14:40:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:14,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202643116] [2024-11-10 14:40:14,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202643116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:14,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184929987] [2024-11-10 14:40:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:14,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:14,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:14,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 328 [2024-11-10 14:40:14,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:14,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:14,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 328 [2024-11-10 14:40:14,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:14,999 INFO L124 PetriNetUnfolderBase]: 31/495 cut-off events. [2024-11-10 14:40:15,000 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2024-11-10 14:40:15,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 495 events. 31/495 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1577 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 510. Up to 63 conditions per place. [2024-11-10 14:40:15,002 INFO L140 encePairwiseOnDemand]: 326/328 looper letters, 12 selfloop transitions, 1 changer transitions 0/249 dead transitions. [2024-11-10 14:40:15,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 249 transitions, 544 flow [2024-11-10 14:40:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-11-10 14:40:15,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.823170731707317 [2024-11-10 14:40:15,005 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 520 flow. Second operand 3 states and 810 transitions. [2024-11-10 14:40:15,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 249 transitions, 544 flow [2024-11-10 14:40:15,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 249 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:15,011 INFO L231 Difference]: Finished difference. Result has 252 places, 249 transitions, 516 flow [2024-11-10 14:40:15,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=252, PETRI_TRANSITIONS=249} [2024-11-10 14:40:15,012 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -52 predicate places. [2024-11-10 14:40:15,012 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 249 transitions, 516 flow [2024-11-10 14:40:15,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:15,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:15,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:15,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1742732029, now seen corresponding path program 1 times [2024-11-10 14:40:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:15,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849154296] [2024-11-10 14:40:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:15,086 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-10 14:40:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849154296] [2024-11-10 14:40:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849154296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:15,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319022466] [2024-11-10 14:40:15,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:15,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:15,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:15,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:15,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:15,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 328 [2024-11-10 14:40:15,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 249 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:15,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:15,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 328 [2024-11-10 14:40:15,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:15,176 INFO L124 PetriNetUnfolderBase]: 31/494 cut-off events. [2024-11-10 14:40:15,177 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2024-11-10 14:40:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 494 events. 31/494 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1571 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 510. Up to 65 conditions per place. [2024-11-10 14:40:15,180 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 13 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-11-10 14:40:15,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 248 transitions, 544 flow [2024-11-10 14:40:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:15,182 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:15,182 INFO L175 Difference]: Start difference. First operand has 252 places, 249 transitions, 516 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:15,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 248 transitions, 544 flow [2024-11-10 14:40:15,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 248 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:15,187 INFO L231 Difference]: Finished difference. Result has 252 places, 248 transitions, 517 flow [2024-11-10 14:40:15,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=252, PETRI_TRANSITIONS=248} [2024-11-10 14:40:15,188 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -52 predicate places. [2024-11-10 14:40:15,189 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 248 transitions, 517 flow [2024-11-10 14:40:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:15,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:15,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:15,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:15,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:15,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2110712168, now seen corresponding path program 1 times [2024-11-10 14:40:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:15,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215100650] [2024-11-10 14:40:15,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:15,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:15,709 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-10 14:40:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215100650] [2024-11-10 14:40:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215100650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184079385] [2024-11-10 14:40:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:15,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:15,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:15,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 328 [2024-11-10 14:40:15,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 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-10 14:40:15,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:15,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 328 [2024-11-10 14:40:15,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:15,956 INFO L124 PetriNetUnfolderBase]: 31/492 cut-off events. [2024-11-10 14:40:15,956 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2024-11-10 14:40:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 492 events. 31/492 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1558 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 532. Up to 78 conditions per place. [2024-11-10 14:40:15,959 INFO L140 encePairwiseOnDemand]: 316/328 looper letters, 26 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2024-11-10 14:40:15,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 585 flow [2024-11-10 14:40:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2024-11-10 14:40:15,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7560975609756098 [2024-11-10 14:40:15,963 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 517 flow. Second operand 6 states and 1488 transitions. [2024-11-10 14:40:15,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 585 flow [2024-11-10 14:40:15,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 246 transitions, 581 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:15,967 INFO L231 Difference]: Finished difference. Result has 253 places, 246 transitions, 529 flow [2024-11-10 14:40:15,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=253, PETRI_TRANSITIONS=246} [2024-11-10 14:40:15,969 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -51 predicate places. [2024-11-10 14:40:15,970 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 246 transitions, 529 flow [2024-11-10 14:40:15,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 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-10 14:40:15,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:15,971 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] [2024-11-10 14:40:15,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:40:15,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:15,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash 853860862, now seen corresponding path program 1 times [2024-11-10 14:40:15,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:15,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136667573] [2024-11-10 14:40:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,029 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-10 14:40:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136667573] [2024-11-10 14:40:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136667573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622704547] [2024-11-10 14:40:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 328 [2024-11-10 14:40:16,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 246 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:16,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 328 [2024-11-10 14:40:16,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,136 INFO L124 PetriNetUnfolderBase]: 31/491 cut-off events. [2024-11-10 14:40:16,136 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2024-11-10 14:40:16,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 491 events. 31/491 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1563 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 565. Up to 63 conditions per place. [2024-11-10 14:40:16,138 INFO L140 encePairwiseOnDemand]: 326/328 looper letters, 12 selfloop transitions, 1 changer transitions 0/245 dead transitions. [2024-11-10 14:40:16,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 245 transitions, 553 flow [2024-11-10 14:40:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-11-10 14:40:16,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.823170731707317 [2024-11-10 14:40:16,141 INFO L175 Difference]: Start difference. First operand has 253 places, 246 transitions, 529 flow. Second operand 3 states and 810 transitions. [2024-11-10 14:40:16,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 245 transitions, 553 flow [2024-11-10 14:40:16,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 533 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:16,146 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 509 flow [2024-11-10 14:40:16,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2024-11-10 14:40:16,147 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -55 predicate places. [2024-11-10 14:40:16,147 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 509 flow [2024-11-10 14:40:16,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 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-10 14:40:16,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,148 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:16,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:16,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:16,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1981832833, now seen corresponding path program 1 times [2024-11-10 14:40:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282219551] [2024-11-10 14:40:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,189 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-10 14:40:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282219551] [2024-11-10 14:40:16,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282219551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870274812] [2024-11-10 14:40:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 328 [2024-11-10 14:40:16,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:16,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 328 [2024-11-10 14:40:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,270 INFO L124 PetriNetUnfolderBase]: 31/490 cut-off events. [2024-11-10 14:40:16,270 INFO L125 PetriNetUnfolderBase]: For 20/21 co-relation queries the response was YES. [2024-11-10 14:40:16,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 490 events. 31/490 cut-off events. For 20/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1559 event pairs, 18 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 507. Up to 65 conditions per place. [2024-11-10 14:40:16,273 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 13 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-11-10 14:40:16,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 244 transitions, 537 flow [2024-11-10 14:40:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:16,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:16,276 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 509 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:16,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 244 transitions, 537 flow [2024-11-10 14:40:16,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 244 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:16,280 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 510 flow [2024-11-10 14:40:16,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2024-11-10 14:40:16,281 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -55 predicate places. [2024-11-10 14:40:16,281 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 510 flow [2024-11-10 14:40:16,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:16,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:16,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:16,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:16,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1640547611, now seen corresponding path program 1 times [2024-11-10 14:40:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501170855] [2024-11-10 14:40:16,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,329 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-10 14:40:16,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501170855] [2024-11-10 14:40:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501170855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303806693] [2024-11-10 14:40:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 328 [2024-11-10 14:40:16,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-10 14:40:16,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 328 [2024-11-10 14:40:16,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,428 INFO L124 PetriNetUnfolderBase]: 66/504 cut-off events. [2024-11-10 14:40:16,429 INFO L125 PetriNetUnfolderBase]: For 32/40 co-relation queries the response was YES. [2024-11-10 14:40:16,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 504 events. 66/504 cut-off events. For 32/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1706 event pairs, 8 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 618. Up to 108 conditions per place. [2024-11-10 14:40:16,432 INFO L140 encePairwiseOnDemand]: 321/328 looper letters, 16 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2024-11-10 14:40:16,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 245 transitions, 559 flow [2024-11-10 14:40:16,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-11-10 14:40:16,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140243902439024 [2024-11-10 14:40:16,434 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 510 flow. Second operand 3 states and 801 transitions. [2024-11-10 14:40:16,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 245 transitions, 559 flow [2024-11-10 14:40:16,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:16,440 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 510 flow [2024-11-10 14:40:16,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2024-11-10 14:40:16,442 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -58 predicate places. [2024-11-10 14:40:16,442 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 510 flow [2024-11-10 14:40:16,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-10 14:40:16,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,443 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:16,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:16,443 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:16,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash -313220857, now seen corresponding path program 1 times [2024-11-10 14:40:16,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26510730] [2024-11-10 14:40:16,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,520 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-10 14:40:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26510730] [2024-11-10 14:40:16,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26510730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060729989] [2024-11-10 14:40:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 328 [2024-11-10 14:40:16,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:16,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 328 [2024-11-10 14:40:16,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,637 INFO L124 PetriNetUnfolderBase]: 91/675 cut-off events. [2024-11-10 14:40:16,637 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-10 14:40:16,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 675 events. 91/675 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2766 event pairs, 62 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 856. Up to 179 conditions per place. [2024-11-10 14:40:16,641 INFO L140 encePairwiseOnDemand]: 324/328 looper letters, 16 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-11-10 14:40:16,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 242 transitions, 549 flow [2024-11-10 14:40:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 807 transitions. [2024-11-10 14:40:16,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8201219512195121 [2024-11-10 14:40:16,644 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 510 flow. Second operand 3 states and 807 transitions. [2024-11-10 14:40:16,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 242 transitions, 549 flow [2024-11-10 14:40:16,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 242 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:16,649 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 510 flow [2024-11-10 14:40:16,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2024-11-10 14:40:16,649 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -59 predicate places. [2024-11-10 14:40:16,650 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 510 flow [2024-11-10 14:40:16,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-10 14:40:16,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:16,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:40:16,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2120785660, now seen corresponding path program 1 times [2024-11-10 14:40:16,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455663696] [2024-11-10 14:40:16,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,700 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-10 14:40:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455663696] [2024-11-10 14:40:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455663696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129990295] [2024-11-10 14:40:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 328 [2024-11-10 14:40:16,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-10 14:40:16,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 328 [2024-11-10 14:40:16,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:16,803 INFO L124 PetriNetUnfolderBase]: 81/565 cut-off events. [2024-11-10 14:40:16,803 INFO L125 PetriNetUnfolderBase]: For 47/48 co-relation queries the response was YES. [2024-11-10 14:40:16,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 565 events. 81/565 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2028 event pairs, 27 based on Foata normal form. 4/524 useless extension candidates. Maximal degree in co-relation 721. Up to 113 conditions per place. [2024-11-10 14:40:16,806 INFO L140 encePairwiseOnDemand]: 321/328 looper letters, 13 selfloop transitions, 5 changer transitions 4/242 dead transitions. [2024-11-10 14:40:16,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 242 transitions, 557 flow [2024-11-10 14:40:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 800 transitions. [2024-11-10 14:40:16,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8130081300813008 [2024-11-10 14:40:16,808 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 510 flow. Second operand 3 states and 800 transitions. [2024-11-10 14:40:16,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 242 transitions, 557 flow [2024-11-10 14:40:16,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 242 transitions, 557 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:16,813 INFO L231 Difference]: Finished difference. Result has 244 places, 234 transitions, 505 flow [2024-11-10 14:40:16,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=244, PETRI_TRANSITIONS=234} [2024-11-10 14:40:16,815 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -60 predicate places. [2024-11-10 14:40:16,815 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 234 transitions, 505 flow [2024-11-10 14:40:16,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-10 14:40:16,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:16,816 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:40:16,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:16,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:16,817 INFO L85 PathProgramCache]: Analyzing trace with hash -366352106, now seen corresponding path program 1 times [2024-11-10 14:40:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525957851] [2024-11-10 14:40:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:16,883 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-10 14:40:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525957851] [2024-11-10 14:40:16,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525957851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:16,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:16,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:16,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174819788] [2024-11-10 14:40:16,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:16,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:16,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:16,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:16,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 234 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-10 14:40:16,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:16,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:16,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:17,049 INFO L124 PetriNetUnfolderBase]: 76/594 cut-off events. [2024-11-10 14:40:17,049 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-10 14:40:17,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 594 events. 76/594 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2211 event pairs, 43 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 799. Up to 116 conditions per place. [2024-11-10 14:40:17,053 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 17 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-11-10 14:40:17,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 237 transitions, 558 flow [2024-11-10 14:40:17,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:17,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:17,056 INFO L175 Difference]: Start difference. First operand has 244 places, 234 transitions, 505 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:17,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 237 transitions, 558 flow [2024-11-10 14:40:17,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 237 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:17,062 INFO L231 Difference]: Finished difference. Result has 239 places, 233 transitions, 497 flow [2024-11-10 14:40:17,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=239, PETRI_TRANSITIONS=233} [2024-11-10 14:40:17,063 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -65 predicate places. [2024-11-10 14:40:17,064 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 233 transitions, 497 flow [2024-11-10 14:40:17,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-10 14:40:17,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:17,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:17,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:40:17,065 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err20ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-11-10 14:40:17,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:17,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2015584885, now seen corresponding path program 1 times [2024-11-10 14:40:17,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:17,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207697937] [2024-11-10 14:40:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:17,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:17,143 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-10 14:40:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207697937] [2024-11-10 14:40:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207697937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:17,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:17,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205542082] [2024-11-10 14:40:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:17,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:17,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:17,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:17,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 328 [2024-11-10 14:40:17,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 233 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-10 14:40:17,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:17,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 328 [2024-11-10 14:40:17,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:17,249 INFO L124 PetriNetUnfolderBase]: 81/540 cut-off events. [2024-11-10 14:40:17,249 INFO L125 PetriNetUnfolderBase]: For 45/46 co-relation queries the response was YES. [2024-11-10 14:40:17,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779 conditions, 540 events. 81/540 cut-off events. For 45/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1960 event pairs, 48 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 694. Up to 129 conditions per place. [2024-11-10 14:40:17,251 INFO L140 encePairwiseOnDemand]: 325/328 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2024-11-10 14:40:17,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 236 transitions, 546 flow [2024-11-10 14:40:17,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2024-11-10 14:40:17,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8160569105691057 [2024-11-10 14:40:17,253 INFO L175 Difference]: Start difference. First operand has 239 places, 233 transitions, 497 flow. Second operand 3 states and 803 transitions. [2024-11-10 14:40:17,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 236 transitions, 546 flow [2024-11-10 14:40:17,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 236 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:17,256 INFO L231 Difference]: Finished difference. Result has 238 places, 0 transitions, 0 flow [2024-11-10 14:40:17,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=238, PETRI_TRANSITIONS=0} [2024-11-10 14:40:17,257 INFO L277 CegarLoopForPetriNet]: 304 programPoint places, -66 predicate places. [2024-11-10 14:40:17,257 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 0 transitions, 0 flow [2024-11-10 14:40:17,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2024-11-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2024-11-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2024-11-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2024-11-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2024-11-10 14:40:17,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2024-11-10 14:40:17,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2024-11-10 14:40:17,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2024-11-10 14:40:17,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2024-11-10 14:40:17,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2024-11-10 14:40:17,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (56 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (55 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 115 remaining) [2024-11-10 14:40:17,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2024-11-10 14:40:17,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2024-11-10 14:40:17,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2024-11-10 14:40:17,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2024-11-10 14:40:17,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2024-11-10 14:40:17,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2024-11-10 14:40:17,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2024-11-10 14:40:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:40:17,271 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:17,277 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:40:17,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:17,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:17 BasicIcfg [2024-11-10 14:40:17,282 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:17,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:17,283 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:17,283 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:17,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:12" (3/4) ... [2024-11-10 14:40:17,285 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:40:17,287 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:40:17,287 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:40:17,294 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-11-10 14:40:17,295 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:40:17,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:40:17,296 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:40:17,396 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:17,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:40:17,397 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:17,397 INFO L158 Benchmark]: Toolchain (without parser) took 6569.45ms. Allocated memory was 144.7MB in the beginning and 350.2MB in the end (delta: 205.5MB). Free memory was 86.1MB in the beginning and 187.9MB in the end (delta: -101.7MB). Peak memory consumption was 106.9MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,397 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:17,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.82ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 71.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.96ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 68.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,398 INFO L158 Benchmark]: Boogie Preprocessor took 45.69ms. Allocated memory is still 144.7MB. Free memory was 68.1MB in the beginning and 65.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,398 INFO L158 Benchmark]: IcfgBuilder took 1304.98ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 65.6MB in the beginning and 91.9MB in the end (delta: -26.3MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,399 INFO L158 Benchmark]: TraceAbstraction took 4750.15ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 91.9MB in the beginning and 195.2MB in the end (delta: -103.3MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,399 INFO L158 Benchmark]: Witness Printer took 114.28ms. Allocated memory is still 350.2MB. Free memory was 195.2MB in the beginning and 187.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:40:17,400 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 144.7MB. Free memory is still 105.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.82ms. Allocated memory is still 144.7MB. Free memory was 86.1MB in the beginning and 71.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.96ms. Allocated memory is still 144.7MB. Free memory was 71.5MB in the beginning and 68.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.69ms. Allocated memory is still 144.7MB. Free memory was 68.1MB in the beginning and 65.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1304.98ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 65.6MB in the beginning and 91.9MB in the end (delta: -26.3MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4750.15ms. Allocated memory was 199.2MB in the beginning and 350.2MB in the end (delta: 151.0MB). Free memory was 91.9MB in the beginning and 195.2MB in the end (delta: -103.3MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 114.28ms. Allocated memory is still 350.2MB. Free memory was 195.2MB in the beginning and 187.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: 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: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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 5 procedures, 406 locations, 115 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.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 70 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=630occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1826 NumberOfCodeBlocks, 1826 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:40:17,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE