./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:34:06,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:34:06,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-24 15:34:06,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:34:06,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:34:06,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:34:06,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:34:06,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:34:06,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:34:07,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:34:07,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:34:07,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:34:07,001 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:34:07,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:34:07,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:34:07,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:34:07,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:34:07,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:34:07,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:34:07,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:34:07,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:34:07,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:34:07,005 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-24 15:34:07,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:34:07,006 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:34:07,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:34:07,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:34:07,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:34:07,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:34:07,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:34:07,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:34:07,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:34:07,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:34:07,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:34:07,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:34:07,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:34:07,009 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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2024-10-24 15:34:07,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:34:07,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:34:07,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:34:07,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:34:07,224 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:34:07,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-10-24 15:34:08,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:34:08,551 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:34:08,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-10-24 15:34:08,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f138891/08d6083e798143f4991ed0ada11bab95/FLAG5557c24f8 [2024-10-24 15:34:08,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f138891/08d6083e798143f4991ed0ada11bab95 [2024-10-24 15:34:08,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:34:08,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:34:08,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:34:08,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:34:08,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:34:08,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc0091c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08, skipping insertion in model container [2024-10-24 15:34:08,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:34:08,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:34:08,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:34:08,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:34:08,919 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:34:08,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08 WrapperNode [2024-10-24 15:34:08,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:34:08,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:34:08,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:34:08,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:34:08,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,979 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 460 [2024-10-24 15:34:08,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:34:08,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:34:08,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:34:08,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:34:08,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:08,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:34:09,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:34:09,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:34:09,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:34:09,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (1/1) ... [2024-10-24 15:34:09,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:34:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:34:09,072 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-10-24 15:34:09,074 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-10-24 15:34:09,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:34:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 15:34:09,112 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 15:34:09,112 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 15:34:09,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 15:34:09,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 15:34:09,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:34:09,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:34:09,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:34:09,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-24 15:34:09,116 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 15:34:09,228 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:34:09,230 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:34:09,825 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 15:34:09,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:34:10,208 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:34:10,208 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-24 15:34:10,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:34:10 BoogieIcfgContainer [2024-10-24 15:34:10,208 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:34:10,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:34:10,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:34:10,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:34:10,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:34:08" (1/3) ... [2024-10-24 15:34:10,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bcab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:34:10, skipping insertion in model container [2024-10-24 15:34:10,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:34:08" (2/3) ... [2024-10-24 15:34:10,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bcab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:34:10, skipping insertion in model container [2024-10-24 15:34:10,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:34:10" (3/3) ... [2024-10-24 15:34:10,216 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2024-10-24 15:34:10,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:34:10,230 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-24 15:34:10,230 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 15:34:10,309 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 15:34:10,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 347 places, 355 transitions, 731 flow [2024-10-24 15:34:10,419 INFO L124 PetriNetUnfolderBase]: 18/352 cut-off events. [2024-10-24 15:34:10,419 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 15:34:10,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 352 events. 18/352 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 533 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 299. Up to 3 conditions per place. [2024-10-24 15:34:10,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 347 places, 355 transitions, 731 flow [2024-10-24 15:34:10,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 328 places, 335 transitions, 688 flow [2024-10-24 15:34:10,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:34:10,453 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;@10f43bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:34:10,453 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-10-24 15:34:10,458 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 15:34:10,458 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-24 15:34:10,458 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-24 15:34:10,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:10,459 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] [2024-10-24 15:34:10,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:10,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135817, now seen corresponding path program 1 times [2024-10-24 15:34:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066268293] [2024-10-24 15:34:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:10,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:10,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066268293] [2024-10-24 15:34:10,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066268293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:10,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:10,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:10,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051555891] [2024-10-24 15:34:10,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:10,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:10,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 355 [2024-10-24 15:34:10,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 335 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:10,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:10,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 355 [2024-10-24 15:34:10,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:10,856 INFO L124 PetriNetUnfolderBase]: 78/610 cut-off events. [2024-10-24 15:34:10,857 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-10-24 15:34:10,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 610 events. 78/610 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2368 event pairs, 51 based on Foata normal form. 50/573 useless extension candidates. Maximal degree in co-relation 513. Up to 128 conditions per place. [2024-10-24 15:34:10,865 INFO L140 encePairwiseOnDemand]: 296/355 looper letters, 17 selfloop transitions, 2 changer transitions 5/278 dead transitions. [2024-10-24 15:34:10,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 278 transitions, 612 flow [2024-10-24 15:34:10,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:10,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2024-10-24 15:34:10,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488262910798122 [2024-10-24 15:34:10,882 INFO L175 Difference]: Start difference. First operand has 328 places, 335 transitions, 688 flow. Second operand 3 states and 904 transitions. [2024-10-24 15:34:10,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 278 transitions, 612 flow [2024-10-24 15:34:10,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 278 transitions, 600 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 15:34:10,890 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 556 flow [2024-10-24 15:34:10,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2024-10-24 15:34:10,894 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -49 predicate places. [2024-10-24 15:34:10,895 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 556 flow [2024-10-24 15:34:10,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:10,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:10,895 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] [2024-10-24 15:34:10,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 15:34:10,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 482301345, now seen corresponding path program 1 times [2024-10-24 15:34:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:10,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037488106] [2024-10-24 15:34:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:10,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:10,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037488106] [2024-10-24 15:34:10,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037488106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:10,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:10,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:10,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641153957] [2024-10-24 15:34:10,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:10,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:10,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-24 15:34:10,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:10,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:10,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-24 15:34:10,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,023 INFO L124 PetriNetUnfolderBase]: 72/552 cut-off events. [2024-10-24 15:34:11,023 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:34:11,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680 conditions, 552 events. 72/552 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1920 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 644. Up to 109 conditions per place. [2024-10-24 15:34:11,027 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-10-24 15:34:11,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 272 transitions, 588 flow [2024-10-24 15:34:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-24 15:34:11,029 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-24 15:34:11,029 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 556 flow. Second operand 3 states and 852 transitions. [2024-10-24 15:34:11,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 272 transitions, 588 flow [2024-10-24 15:34:11,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 272 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:11,033 INFO L231 Difference]: Finished difference. Result has 273 places, 272 transitions, 554 flow [2024-10-24 15:34:11,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=273, PETRI_TRANSITIONS=272} [2024-10-24 15:34:11,034 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -55 predicate places. [2024-10-24 15:34:11,034 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 272 transitions, 554 flow [2024-10-24 15:34:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,035 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] [2024-10-24 15:34:11,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 15:34:11,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1923557905, now seen corresponding path program 1 times [2024-10-24 15:34:11,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582190905] [2024-10-24 15:34:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582190905] [2024-10-24 15:34:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582190905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472944202] [2024-10-24 15:34:11,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-24 15:34:11,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 272 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-24 15:34:11,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,222 INFO L124 PetriNetUnfolderBase]: 72/551 cut-off events. [2024-10-24 15:34:11,223 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:34:11,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 551 events. 72/551 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1926 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 635. Up to 109 conditions per place. [2024-10-24 15:34:11,225 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-10-24 15:34:11,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 271 transitions, 586 flow [2024-10-24 15:34:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-24 15:34:11,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-24 15:34:11,227 INFO L175 Difference]: Start difference. First operand has 273 places, 272 transitions, 554 flow. Second operand 3 states and 852 transitions. [2024-10-24 15:34:11,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 271 transitions, 586 flow [2024-10-24 15:34:11,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 271 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:11,232 INFO L231 Difference]: Finished difference. Result has 272 places, 271 transitions, 552 flow [2024-10-24 15:34:11,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=272, PETRI_TRANSITIONS=271} [2024-10-24 15:34:11,233 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -56 predicate places. [2024-10-24 15:34:11,234 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 271 transitions, 552 flow [2024-10-24 15:34:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,235 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:11,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 15:34:11,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1784832, now seen corresponding path program 1 times [2024-10-24 15:34:11,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151688280] [2024-10-24 15:34:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151688280] [2024-10-24 15:34:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151688280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824120572] [2024-10-24 15:34:11,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-24 15:34:11,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-24 15:34:11,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,368 INFO L124 PetriNetUnfolderBase]: 72/550 cut-off events. [2024-10-24 15:34:11,368 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-24 15:34:11,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 550 events. 72/550 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1927 event pairs, 38 based on Foata normal form. 0/473 useless extension candidates. Maximal degree in co-relation 626. Up to 109 conditions per place. [2024-10-24 15:34:11,372 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-10-24 15:34:11,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 270 transitions, 584 flow [2024-10-24 15:34:11,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-24 15:34:11,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-24 15:34:11,374 INFO L175 Difference]: Start difference. First operand has 272 places, 271 transitions, 552 flow. Second operand 3 states and 852 transitions. [2024-10-24 15:34:11,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 270 transitions, 584 flow [2024-10-24 15:34:11,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 270 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:11,378 INFO L231 Difference]: Finished difference. Result has 271 places, 270 transitions, 550 flow [2024-10-24 15:34:11,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2024-10-24 15:34:11,379 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-10-24 15:34:11,379 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 550 flow [2024-10-24 15:34:11,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,380 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] [2024-10-24 15:34:11,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 15:34:11,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash 982811327, now seen corresponding path program 1 times [2024-10-24 15:34:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643231017] [2024-10-24 15:34:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643231017] [2024-10-24 15:34:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643231017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818169734] [2024-10-24 15:34:11,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-24 15:34:11,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-24 15:34:11,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,527 INFO L124 PetriNetUnfolderBase]: 75/598 cut-off events. [2024-10-24 15:34:11,527 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2024-10-24 15:34:11,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 75/598 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2350 event pairs, 18 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 665. Up to 81 conditions per place. [2024-10-24 15:34:11,531 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 18 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-10-24 15:34:11,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 275 transitions, 602 flow [2024-10-24 15:34:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2024-10-24 15:34:11,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8140845070422535 [2024-10-24 15:34:11,533 INFO L175 Difference]: Start difference. First operand has 271 places, 270 transitions, 550 flow. Second operand 3 states and 867 transitions. [2024-10-24 15:34:11,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 275 transitions, 602 flow [2024-10-24 15:34:11,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 275 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:11,538 INFO L231 Difference]: Finished difference. Result has 271 places, 270 transitions, 554 flow [2024-10-24 15:34:11,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2024-10-24 15:34:11,539 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-10-24 15:34:11,540 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 554 flow [2024-10-24 15:34:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,541 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] [2024-10-24 15:34:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 15:34:11,542 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 93558661, now seen corresponding path program 1 times [2024-10-24 15:34:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538396126] [2024-10-24 15:34:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538396126] [2024-10-24 15:34:11,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538396126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502421560] [2024-10-24 15:34:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:11,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,715 INFO L124 PetriNetUnfolderBase]: 72/552 cut-off events. [2024-10-24 15:34:11,715 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-10-24 15:34:11,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 552 events. 72/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1969 event pairs, 38 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 302. Up to 110 conditions per place. [2024-10-24 15:34:11,719 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 15 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-10-24 15:34:11,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 269 transitions, 586 flow [2024-10-24 15:34:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-24 15:34:11,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-24 15:34:11,722 INFO L175 Difference]: Start difference. First operand has 271 places, 270 transitions, 554 flow. Second operand 3 states and 854 transitions. [2024-10-24 15:34:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 269 transitions, 586 flow [2024-10-24 15:34:11,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 269 transitions, 584 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:34:11,727 INFO L231 Difference]: Finished difference. Result has 271 places, 269 transitions, 554 flow [2024-10-24 15:34:11,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=271, PETRI_TRANSITIONS=269} [2024-10-24 15:34:11,728 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-10-24 15:34:11,729 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 269 transitions, 554 flow [2024-10-24 15:34:11,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,730 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] [2024-10-24 15:34:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 15:34:11,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash -226231868, now seen corresponding path program 1 times [2024-10-24 15:34:11,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556687324] [2024-10-24 15:34:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556687324] [2024-10-24 15:34:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556687324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662857212] [2024-10-24 15:34:11,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 355 [2024-10-24 15:34:11,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 269 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 355 [2024-10-24 15:34:11,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:11,865 INFO L124 PetriNetUnfolderBase]: 72/551 cut-off events. [2024-10-24 15:34:11,865 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-10-24 15:34:11,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 551 events. 72/551 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1984 event pairs, 38 based on Foata normal form. 0/477 useless extension candidates. Maximal degree in co-relation 636. Up to 111 conditions per place. [2024-10-24 15:34:11,868 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-10-24 15:34:11,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 268 transitions, 588 flow [2024-10-24 15:34:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-10-24 15:34:11,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8 [2024-10-24 15:34:11,870 INFO L175 Difference]: Start difference. First operand has 271 places, 269 transitions, 554 flow. Second operand 3 states and 852 transitions. [2024-10-24 15:34:11,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 268 transitions, 588 flow [2024-10-24 15:34:11,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 268 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:11,873 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 552 flow [2024-10-24 15:34:11,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2024-10-24 15:34:11,874 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-10-24 15:34:11,874 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 552 flow [2024-10-24 15:34:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:11,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:11,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 15:34:11,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:11,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1158635260, now seen corresponding path program 1 times [2024-10-24 15:34:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111551862] [2024-10-24 15:34:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:11,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:11,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:11,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111551862] [2024-10-24 15:34:11,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111551862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:11,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:11,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491670530] [2024-10-24 15:34:11,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:11,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-24 15:34:11,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:11,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:11,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-24 15:34:11,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:12,007 INFO L124 PetriNetUnfolderBase]: 83/654 cut-off events. [2024-10-24 15:34:12,007 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-10-24 15:34:12,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 654 events. 83/654 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2733 event pairs, 20 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 741. Up to 66 conditions per place. [2024-10-24 15:34:12,010 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 21 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-10-24 15:34:12,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 275 transitions, 618 flow [2024-10-24 15:34:12,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2024-10-24 15:34:12,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8150234741784037 [2024-10-24 15:34:12,011 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 552 flow. Second operand 3 states and 868 transitions. [2024-10-24 15:34:12,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 275 transitions, 618 flow [2024-10-24 15:34:12,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 275 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:12,015 INFO L231 Difference]: Finished difference. Result has 270 places, 268 transitions, 556 flow [2024-10-24 15:34:12,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=270, PETRI_TRANSITIONS=268} [2024-10-24 15:34:12,016 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-10-24 15:34:12,016 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 268 transitions, 556 flow [2024-10-24 15:34:12,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:12,017 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:12,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 15:34:12,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:12,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:12,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1569781646, now seen corresponding path program 1 times [2024-10-24 15:34:12,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:12,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820837498] [2024-10-24 15:34:12,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:12,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820837498] [2024-10-24 15:34:12,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820837498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953649404] [2024-10-24 15:34:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:12,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:12,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 268 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:12,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:12,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:12,127 INFO L124 PetriNetUnfolderBase]: 83/564 cut-off events. [2024-10-24 15:34:12,127 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-10-24 15:34:12,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 564 events. 83/564 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2012 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 450. Up to 123 conditions per place. [2024-10-24 15:34:12,130 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-10-24 15:34:12,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 267 transitions, 590 flow [2024-10-24 15:34:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-24 15:34:12,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-24 15:34:12,132 INFO L175 Difference]: Start difference. First operand has 270 places, 268 transitions, 556 flow. Second operand 3 states and 854 transitions. [2024-10-24 15:34:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 267 transitions, 590 flow [2024-10-24 15:34:12,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 267 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:34:12,136 INFO L231 Difference]: Finished difference. Result has 270 places, 267 transitions, 556 flow [2024-10-24 15:34:12,137 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=270, PETRI_TRANSITIONS=267} [2024-10-24 15:34:12,138 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -58 predicate places. [2024-10-24 15:34:12,138 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 267 transitions, 556 flow [2024-10-24 15:34:12,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:12,139 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:12,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 15:34:12,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1759747340, now seen corresponding path program 1 times [2024-10-24 15:34:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980347131] [2024-10-24 15:34:12,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980347131] [2024-10-24 15:34:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980347131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:12,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:12,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695695261] [2024-10-24 15:34:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:12,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:12,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:12,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:12,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:12,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-24 15:34:12,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 267 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:12,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-24 15:34:12,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:12,260 INFO L124 PetriNetUnfolderBase]: 83/563 cut-off events. [2024-10-24 15:34:12,260 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-24 15:34:12,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 563 events. 83/563 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2010 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 669. Up to 121 conditions per place. [2024-10-24 15:34:12,263 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2024-10-24 15:34:12,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 266 transitions, 586 flow [2024-10-24 15:34:12,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-10-24 15:34:12,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-10-24 15:34:12,265 INFO L175 Difference]: Start difference. First operand has 270 places, 267 transitions, 556 flow. Second operand 3 states and 861 transitions. [2024-10-24 15:34:12,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 266 transitions, 586 flow [2024-10-24 15:34:12,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 266 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:12,268 INFO L231 Difference]: Finished difference. Result has 269 places, 266 transitions, 552 flow [2024-10-24 15:34:12,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=269, PETRI_TRANSITIONS=266} [2024-10-24 15:34:12,269 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -59 predicate places. [2024-10-24 15:34:12,270 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 266 transitions, 552 flow [2024-10-24 15:34:12,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:12,270 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:12,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 15:34:12,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:12,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash 331087877, now seen corresponding path program 1 times [2024-10-24 15:34:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974411097] [2024-10-24 15:34:12,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974411097] [2024-10-24 15:34:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974411097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:34:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859036877] [2024-10-24 15:34:12,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:34:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:34:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:34:12,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 355 [2024-10-24 15:34:12,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 266 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:12,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 355 [2024-10-24 15:34:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:12,903 INFO L124 PetriNetUnfolderBase]: 83/561 cut-off events. [2024-10-24 15:34:12,904 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-24 15:34:12,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 561 events. 83/561 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1999 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 690. Up to 136 conditions per place. [2024-10-24 15:34:12,906 INFO L140 encePairwiseOnDemand]: 343/355 looper letters, 29 selfloop transitions, 10 changer transitions 0/264 dead transitions. [2024-10-24 15:34:12,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 264 transitions, 626 flow [2024-10-24 15:34:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:34:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 15:34:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1587 transitions. [2024-10-24 15:34:12,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7450704225352113 [2024-10-24 15:34:12,909 INFO L175 Difference]: Start difference. First operand has 269 places, 266 transitions, 552 flow. Second operand 6 states and 1587 transitions. [2024-10-24 15:34:12,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 264 transitions, 626 flow [2024-10-24 15:34:12,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 264 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:34:12,912 INFO L231 Difference]: Finished difference. Result has 271 places, 264 transitions, 567 flow [2024-10-24 15:34:12,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=567, PETRI_PLACES=271, PETRI_TRANSITIONS=264} [2024-10-24 15:34:12,913 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -57 predicate places. [2024-10-24 15:34:12,913 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 264 transitions, 567 flow [2024-10-24 15:34:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.5) internal successors, (1557), 6 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:12,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:12,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 15:34:12,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:12,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1052646361, now seen corresponding path program 1 times [2024-10-24 15:34:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286735490] [2024-10-24 15:34:12,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:12,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286735490] [2024-10-24 15:34:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286735490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572063062] [2024-10-24 15:34:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:12,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:12,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:12,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:12,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 264 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:12,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:12,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,018 INFO L124 PetriNetUnfolderBase]: 83/560 cut-off events. [2024-10-24 15:34:13,019 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-24 15:34:13,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 763 conditions, 560 events. 83/560 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1993 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 728. Up to 123 conditions per place. [2024-10-24 15:34:13,022 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2024-10-24 15:34:13,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 263 transitions, 601 flow [2024-10-24 15:34:13,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-24 15:34:13,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-24 15:34:13,024 INFO L175 Difference]: Start difference. First operand has 271 places, 264 transitions, 567 flow. Second operand 3 states and 854 transitions. [2024-10-24 15:34:13,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 263 transitions, 601 flow [2024-10-24 15:34:13,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 581 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-24 15:34:13,027 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 549 flow [2024-10-24 15:34:13,027 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2024-10-24 15:34:13,028 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -61 predicate places. [2024-10-24 15:34:13,028 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 549 flow [2024-10-24 15:34:13,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 15:34:13,029 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash -903620565, now seen corresponding path program 1 times [2024-10-24 15:34:13,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276875620] [2024-10-24 15:34:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276875620] [2024-10-24 15:34:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276875620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474928177] [2024-10-24 15:34:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-24 15:34:13,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-24 15:34:13,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,124 INFO L124 PetriNetUnfolderBase]: 83/559 cut-off events. [2024-10-24 15:34:13,125 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-24 15:34:13,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 559 events. 83/559 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2003 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 666. Up to 121 conditions per place. [2024-10-24 15:34:13,128 INFO L140 encePairwiseOnDemand]: 353/355 looper letters, 15 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2024-10-24 15:34:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 579 flow [2024-10-24 15:34:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2024-10-24 15:34:13,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8084507042253521 [2024-10-24 15:34:13,130 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 549 flow. Second operand 3 states and 861 transitions. [2024-10-24 15:34:13,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 579 flow [2024-10-24 15:34:13,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:13,133 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 545 flow [2024-10-24 15:34:13,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2024-10-24 15:34:13,134 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -62 predicate places. [2024-10-24 15:34:13,134 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 545 flow [2024-10-24 15:34:13,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,134 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 15:34:13,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash 743531059, now seen corresponding path program 1 times [2024-10-24 15:34:13,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965139777] [2024-10-24 15:34:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965139777] [2024-10-24 15:34:13,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965139777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913339995] [2024-10-24 15:34:13,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:13,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:13,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,250 INFO L124 PetriNetUnfolderBase]: 83/558 cut-off events. [2024-10-24 15:34:13,250 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-10-24 15:34:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 558 events. 83/558 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1999 event pairs, 38 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 666. Up to 123 conditions per place. [2024-10-24 15:34:13,254 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 16 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-10-24 15:34:13,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 579 flow [2024-10-24 15:34:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2024-10-24 15:34:13,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8018779342723005 [2024-10-24 15:34:13,256 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 545 flow. Second operand 3 states and 854 transitions. [2024-10-24 15:34:13,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 579 flow [2024-10-24 15:34:13,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 261 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:34:13,259 INFO L231 Difference]: Finished difference. Result has 266 places, 261 transitions, 546 flow [2024-10-24 15:34:13,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=266, PETRI_TRANSITIONS=261} [2024-10-24 15:34:13,260 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -62 predicate places. [2024-10-24 15:34:13,260 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 261 transitions, 546 flow [2024-10-24 15:34:13,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,261 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] [2024-10-24 15:34:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 15:34:13,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 106641979, now seen corresponding path program 1 times [2024-10-24 15:34:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455362520] [2024-10-24 15:34:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455362520] [2024-10-24 15:34:13,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455362520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477257294] [2024-10-24 15:34:13,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 355 [2024-10-24 15:34:13,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 261 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 355 [2024-10-24 15:34:13,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,380 INFO L124 PetriNetUnfolderBase]: 112/669 cut-off events. [2024-10-24 15:34:13,380 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-10-24 15:34:13,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 669 events. 112/669 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2845 event pairs, 64 based on Foata normal form. 1/588 useless extension candidates. Maximal degree in co-relation 859. Up to 171 conditions per place. [2024-10-24 15:34:13,384 INFO L140 encePairwiseOnDemand]: 351/355 looper letters, 17 selfloop transitions, 1 changer transitions 2/258 dead transitions. [2024-10-24 15:34:13,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 578 flow [2024-10-24 15:34:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2024-10-24 15:34:13,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7962441314553991 [2024-10-24 15:34:13,386 INFO L175 Difference]: Start difference. First operand has 266 places, 261 transitions, 546 flow. Second operand 3 states and 848 transitions. [2024-10-24 15:34:13,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 578 flow [2024-10-24 15:34:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 258 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:13,390 INFO L231 Difference]: Finished difference. Result has 263 places, 256 transitions, 534 flow [2024-10-24 15:34:13,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=263, PETRI_TRANSITIONS=256} [2024-10-24 15:34:13,391 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -65 predicate places. [2024-10-24 15:34:13,391 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 256 transitions, 534 flow [2024-10-24 15:34:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,392 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 15:34:13,392 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1176002019, now seen corresponding path program 1 times [2024-10-24 15:34:13,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777933145] [2024-10-24 15:34:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777933145] [2024-10-24 15:34:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777933145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888757169] [2024-10-24 15:34:13,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 355 [2024-10-24 15:34:13,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 256 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 355 [2024-10-24 15:34:13,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,566 INFO L124 PetriNetUnfolderBase]: 158/619 cut-off events. [2024-10-24 15:34:13,567 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-10-24 15:34:13,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 619 events. 158/619 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2280 event pairs, 53 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 865. Up to 156 conditions per place. [2024-10-24 15:34:13,570 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-10-24 15:34:13,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 261 transitions, 594 flow [2024-10-24 15:34:13,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-10-24 15:34:13,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8131455399061033 [2024-10-24 15:34:13,573 INFO L175 Difference]: Start difference. First operand has 263 places, 256 transitions, 534 flow. Second operand 3 states and 866 transitions. [2024-10-24 15:34:13,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 261 transitions, 594 flow [2024-10-24 15:34:13,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 261 transitions, 593 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 15:34:13,577 INFO L231 Difference]: Finished difference. Result has 261 places, 255 transitions, 535 flow [2024-10-24 15:34:13,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=259, 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=535, PETRI_PLACES=261, PETRI_TRANSITIONS=255} [2024-10-24 15:34:13,578 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -67 predicate places. [2024-10-24 15:34:13,578 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 255 transitions, 535 flow [2024-10-24 15:34:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 15:34:13,579 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1474712218, now seen corresponding path program 1 times [2024-10-24 15:34:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163278178] [2024-10-24 15:34:13,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163278178] [2024-10-24 15:34:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163278178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138431897] [2024-10-24 15:34:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 355 [2024-10-24 15:34:13,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 255 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 355 [2024-10-24 15:34:13,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,736 INFO L124 PetriNetUnfolderBase]: 208/659 cut-off events. [2024-10-24 15:34:13,736 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-10-24 15:34:13,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 659 events. 208/659 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2460 event pairs, 83 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 1021. Up to 228 conditions per place. [2024-10-24 15:34:13,740 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 22 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-10-24 15:34:13,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 260 transitions, 599 flow [2024-10-24 15:34:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions. [2024-10-24 15:34:13,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8093896713615023 [2024-10-24 15:34:13,742 INFO L175 Difference]: Start difference. First operand has 261 places, 255 transitions, 535 flow. Second operand 3 states and 862 transitions. [2024-10-24 15:34:13,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 260 transitions, 599 flow [2024-10-24 15:34:13,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 260 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:13,745 INFO L231 Difference]: Finished difference. Result has 260 places, 254 transitions, 533 flow [2024-10-24 15:34:13,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=258, 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=533, PETRI_PLACES=260, PETRI_TRANSITIONS=254} [2024-10-24 15:34:13,746 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -68 predicate places. [2024-10-24 15:34:13,746 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 254 transitions, 533 flow [2024-10-24 15:34:13,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,747 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 15:34:13,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1710681680, now seen corresponding path program 1 times [2024-10-24 15:34:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217790575] [2024-10-24 15:34:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217790575] [2024-10-24 15:34:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217790575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707684301] [2024-10-24 15:34:13,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:13,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 254 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:13,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:13,908 INFO L124 PetriNetUnfolderBase]: 167/729 cut-off events. [2024-10-24 15:34:13,908 INFO L125 PetriNetUnfolderBase]: For 93/105 co-relation queries the response was YES. [2024-10-24 15:34:13,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 729 events. 167/729 cut-off events. For 93/105 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3157 event pairs, 56 based on Foata normal form. 1/659 useless extension candidates. Maximal degree in co-relation 1002. Up to 161 conditions per place. [2024-10-24 15:34:13,912 INFO L140 encePairwiseOnDemand]: 350/355 looper letters, 20 selfloop transitions, 2 changer transitions 2/259 dead transitions. [2024-10-24 15:34:13,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 597 flow [2024-10-24 15:34:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-10-24 15:34:13,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8075117370892019 [2024-10-24 15:34:13,913 INFO L175 Difference]: Start difference. First operand has 260 places, 254 transitions, 533 flow. Second operand 3 states and 860 transitions. [2024-10-24 15:34:13,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 597 flow [2024-10-24 15:34:13,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 259 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:13,917 INFO L231 Difference]: Finished difference. Result has 258 places, 250 transitions, 524 flow [2024-10-24 15:34:13,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=256, 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=524, PETRI_PLACES=258, PETRI_TRANSITIONS=250} [2024-10-24 15:34:13,917 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -70 predicate places. [2024-10-24 15:34:13,917 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 250 transitions, 524 flow [2024-10-24 15:34:13,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 15:34:13,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:34:13,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 15:34:13,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-10-24 15:34:13,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:34:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1673666925, now seen corresponding path program 1 times [2024-10-24 15:34:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 15:34:13,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641869500] [2024-10-24 15:34:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:34:13,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 15:34:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:34:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:34:13,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 15:34:13,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641869500] [2024-10-24 15:34:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641869500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:34:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:34:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:34:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698228521] [2024-10-24 15:34:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:34:13,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:34:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 15:34:13,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:34:13,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:34:13,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 355 [2024-10-24 15:34:13,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 250 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:13,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 15:34:13,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 355 [2024-10-24 15:34:13,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 15:34:14,064 INFO L124 PetriNetUnfolderBase]: 223/771 cut-off events. [2024-10-24 15:34:14,064 INFO L125 PetriNetUnfolderBase]: For 130/156 co-relation queries the response was YES. [2024-10-24 15:34:14,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 771 events. 223/771 cut-off events. For 130/156 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3352 event pairs, 92 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1146. Up to 242 conditions per place. [2024-10-24 15:34:14,067 INFO L140 encePairwiseOnDemand]: 352/355 looper letters, 0 selfloop transitions, 0 changer transitions 256/256 dead transitions. [2024-10-24 15:34:14,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 256 transitions, 590 flow [2024-10-24 15:34:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:34:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 15:34:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-24 15:34:14,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8065727699530516 [2024-10-24 15:34:14,068 INFO L175 Difference]: Start difference. First operand has 258 places, 250 transitions, 524 flow. Second operand 3 states and 859 transitions. [2024-10-24 15:34:14,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 256 transitions, 590 flow [2024-10-24 15:34:14,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 15:34:14,071 INFO L231 Difference]: Finished difference. Result has 255 places, 0 transitions, 0 flow [2024-10-24 15:34:14,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=255, PETRI_TRANSITIONS=0} [2024-10-24 15:34:14,071 INFO L277 CegarLoopForPetriNet]: 328 programPoint places, -73 predicate places. [2024-10-24 15:34:14,072 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 0 transitions, 0 flow [2024-10-24 15:34:14,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:34:14,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2024-10-24 15:34:14,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2024-10-24 15:34:14,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2024-10-24 15:34:14,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2024-10-24 15:34:14,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2024-10-24 15:34:14,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2024-10-24 15:34:14,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2024-10-24 15:34:14,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2024-10-24 15:34:14,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2024-10-24 15:34:14,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2024-10-24 15:34:14,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2024-10-24 15:34:14,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2024-10-24 15:34:14,085 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2024-10-24 15:34:14,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2024-10-24 15:34:14,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2024-10-24 15:34:14,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2024-10-24 15:34:14,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2024-10-24 15:34:14,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2024-10-24 15:34:14,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2024-10-24 15:34:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 15:34:14,087 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-10-24 15:34:14,092 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-24 15:34:14,092 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 15:34:14,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:34:14 BasicIcfg [2024-10-24 15:34:14,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 15:34:14,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 15:34:14,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 15:34:14,097 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 15:34:14,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:34:10" (3/4) ... [2024-10-24 15:34:14,098 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 15:34:14,100 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-24 15:34:14,100 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-24 15:34:14,100 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-24 15:34:14,104 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-24 15:34:14,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-24 15:34:14,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 15:34:14,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 15:34:14,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 15:34:14,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 15:34:14,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 15:34:14,177 INFO L158 Benchmark]: Toolchain (without parser) took 5596.68ms. Allocated memory was 148.9MB in the beginning and 352.3MB in the end (delta: 203.4MB). Free memory was 77.5MB in the beginning and 171.1MB in the end (delta: -93.6MB). Peak memory consumption was 112.9MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,178 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:34:14,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.89ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 77.1MB in the beginning and 174.6MB in the end (delta: -97.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 205.5MB. Free memory was 174.6MB in the beginning and 171.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,178 INFO L158 Benchmark]: Boogie Preprocessor took 60.37ms. Allocated memory is still 205.5MB. Free memory was 171.5MB in the beginning and 168.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,178 INFO L158 Benchmark]: RCFGBuilder took 1167.54ms. Allocated memory is still 205.5MB. Free memory was 168.4MB in the beginning and 154.7MB in the end (delta: 13.7MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,180 INFO L158 Benchmark]: TraceAbstraction took 3886.29ms. Allocated memory was 205.5MB in the beginning and 352.3MB in the end (delta: 146.8MB). Free memory was 153.7MB in the beginning and 178.5MB in the end (delta: -24.8MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,180 INFO L158 Benchmark]: Witness Printer took 80.79ms. Allocated memory is still 352.3MB. Free memory was 177.4MB in the beginning and 171.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 15:34:14,181 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.14ms. Allocated memory is still 148.9MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.89ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 77.1MB in the beginning and 174.6MB in the end (delta: -97.5MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 205.5MB. Free memory was 174.6MB in the beginning and 171.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.37ms. Allocated memory is still 205.5MB. Free memory was 171.5MB in the beginning and 168.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1167.54ms. Allocated memory is still 205.5MB. Free memory was 168.4MB in the beginning and 154.7MB in the end (delta: 13.7MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3886.29ms. Allocated memory was 205.5MB in the beginning and 352.3MB in the end (delta: 146.8MB). Free memory was 153.7MB in the beginning and 178.5MB in the end (delta: -24.8MB). Peak memory consumption was 123.0MB. Max. memory is 16.1GB. * Witness Printer took 80.79ms. Allocated memory is still 352.3MB. Free memory was 177.4MB in the beginning and 171.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 90]: 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: 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: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 435 locations, 119 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: 3.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 355 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 87 mSDtfsCounter, 766 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=688occurred 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1877 NumberOfCodeBlocks, 1877 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1858 ConstructedInterpolants, 0 QuantifiedInterpolants, 2009 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 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 15:34:14,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE