./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:39:54,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:39:55,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:39:55,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:39:55,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:39:55,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:39:55,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:39:55,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:39:55,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:39:55,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:39:55,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:39:55,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:39:55,103 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:39:55,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:39:55,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:39:55,105 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:39:55,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:39:55,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:39:55,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:39:55,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:39:55,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:39:55,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:39:55,110 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:39:55,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:39:55,110 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:39:55,110 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:39:55,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:39:55,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:39:55,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:39:55,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:39:55,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:39:55,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:55,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:39:55,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:39:55,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:39:55,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:39:55,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:39:55,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:39:55,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:39:55,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:39:55,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:39:55,121 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-11-10 14:39:55,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:39:55,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:39:55,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:39:55,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:39:55,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:39:55,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-11-10 14:39:56,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:39:57,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:39:57,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2024-11-10 14:39:57,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c80ff0eb/1d6a3a5fa75a4e17a652ec11dd2b9cca/FLAGc5823d452 [2024-11-10 14:39:57,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c80ff0eb/1d6a3a5fa75a4e17a652ec11dd2b9cca [2024-11-10 14:39:57,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:39:57,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:39:57,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:57,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:39:57,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:39:57,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b60cd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57, skipping insertion in model container [2024-11-10 14:39:57,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:39:57,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:57,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:39:57,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:57,748 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:39:57,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57 WrapperNode [2024-11-10 14:39:57,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:57,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:57,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:39:57,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:39:57,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,807 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 455 [2024-11-10 14:39:57,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:57,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:39:57,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:39:57,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:39:57,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:39:57,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:39:57,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:39:57,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:39:57,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (1/1) ... [2024-11-10 14:39:57,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:39:57,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:39:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:39:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:39:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:39:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:39:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:39:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:39:57,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:39:57,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:39:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:39:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:39:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:39:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:39:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:39:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:39:57,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:39:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:39:57,962 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:39:58,087 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:39:58,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:39:58,822 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:39:58,822 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:39:59,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:39:59,262 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:39:59,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:59 BoogieIcfgContainer [2024-11-10 14:39:59,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:39:59,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:39:59,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:39:59,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:39:59,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:39:57" (1/3) ... [2024-11-10 14:39:59,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536319e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:59, skipping insertion in model container [2024-11-10 14:39:59,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:57" (2/3) ... [2024-11-10 14:39:59,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536319e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:59, skipping insertion in model container [2024-11-10 14:39:59,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:59" (3/3) ... [2024-11-10 14:39:59,272 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2024-11-10 14:39:59,290 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:39:59,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-10 14:39:59,291 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:39:59,411 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:39:59,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 351 places, 359 transitions, 739 flow [2024-11-10 14:39:59,639 INFO L124 PetriNetUnfolderBase]: 18/356 cut-off events. [2024-11-10 14:39:59,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:39:59,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 356 events. 18/356 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 539 event pairs, 0 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 302. Up to 3 conditions per place. [2024-11-10 14:39:59,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 359 transitions, 739 flow [2024-11-10 14:39:59,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 332 places, 339 transitions, 696 flow [2024-11-10 14:39:59,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:39:59,685 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;@76971456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:39:59,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2024-11-10 14:39:59,694 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:39:59,694 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-11-10 14:39:59,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:39:59,696 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:59,699 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-11-10 14:39:59,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:39:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1405074364, now seen corresponding path program 1 times [2024-11-10 14:39:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41669830] [2024-11-10 14:39:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:59,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-11-10 14:39:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41669830] [2024-11-10 14:39:59,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41669830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:59,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:59,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634180149] [2024-11-10 14:39:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:59,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:59,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:00,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 359 [2024-11-10 14:40:00,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:00,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 359 [2024-11-10 14:40:00,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:00,295 INFO L124 PetriNetUnfolderBase]: 78/627 cut-off events. [2024-11-10 14:40:00,295 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-10 14:40:00,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 627 events. 78/627 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2449 event pairs, 51 based on Foata normal form. 91/633 useless extension candidates. Maximal degree in co-relation 528. Up to 128 conditions per place. [2024-11-10 14:40:00,305 INFO L140 encePairwiseOnDemand]: 300/359 looper letters, 17 selfloop transitions, 2 changer transitions 5/282 dead transitions. [2024-11-10 14:40:00,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 620 flow [2024-11-10 14:40:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2024-11-10 14:40:00,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505106778087279 [2024-11-10 14:40:00,332 INFO L175 Difference]: Start difference. First operand has 332 places, 339 transitions, 696 flow. Second operand 3 states and 916 transitions. [2024-11-10 14:40:00,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 620 flow [2024-11-10 14:40:00,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 608 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:40:00,346 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 564 flow [2024-11-10 14:40:00,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2024-11-10 14:40:00,353 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -49 predicate places. [2024-11-10 14:40:00,354 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 564 flow [2024-11-10 14:40:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,355 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:00,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:00,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:00,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash 341008989, now seen corresponding path program 1 times [2024-11-10 14:40:00,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:00,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905545762] [2024-11-10 14:40:00,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:00,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:00,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905545762] [2024-11-10 14:40:00,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905545762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:00,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:00,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155306496] [2024-11-10 14:40:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:00,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:00,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:00,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:00,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:40:00,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:00,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:40:00,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:00,557 INFO L124 PetriNetUnfolderBase]: 72/566 cut-off events. [2024-11-10 14:40:00,557 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:40:00,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 566 events. 72/566 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2036 event pairs, 38 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 658. Up to 109 conditions per place. [2024-11-10 14:40:00,561 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 15 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-10 14:40:00,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 276 transitions, 596 flow [2024-11-10 14:40:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:40:00,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:40:00,589 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 564 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:40:00,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 276 transitions, 596 flow [2024-11-10 14:40:00,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:00,595 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 562 flow [2024-11-10 14:40:00,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2024-11-10 14:40:00,596 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -55 predicate places. [2024-11-10 14:40:00,596 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 562 flow [2024-11-10 14:40:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,597 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:00,597 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-11-10 14:40:00,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:00,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:00,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 882184310, now seen corresponding path program 1 times [2024-11-10 14:40:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31550199] [2024-11-10 14:40:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:00,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31550199] [2024-11-10 14:40:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31550199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:00,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:00,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:00,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235388263] [2024-11-10 14:40:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:00,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:40:00,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:00,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:40:00,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:00,804 INFO L124 PetriNetUnfolderBase]: 72/565 cut-off events. [2024-11-10 14:40:00,805 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:40:00,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 565 events. 72/565 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2027 event pairs, 38 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 649. Up to 109 conditions per place. [2024-11-10 14:40:00,809 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 15 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-11-10 14:40:00,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 594 flow [2024-11-10 14:40:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:40:00,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:40:00,811 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 562 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:40:00,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 594 flow [2024-11-10 14:40:00,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 275 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:00,817 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 560 flow [2024-11-10 14:40:00,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2024-11-10 14:40:00,818 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -56 predicate places. [2024-11-10 14:40:00,818 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 560 flow [2024-11-10 14:40:00,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,819 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:00,819 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:00,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:00,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1156145573, now seen corresponding path program 1 times [2024-11-10 14:40:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042477509] [2024-11-10 14:40:00,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:00,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042477509] [2024-11-10 14:40:00,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042477509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:00,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165886001] [2024-11-10 14:40:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:00,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:00,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:00,898 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:40:00,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:00,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:00,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:40:00,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:01,025 INFO L124 PetriNetUnfolderBase]: 72/564 cut-off events. [2024-11-10 14:40:01,025 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:40:01,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 564 events. 72/564 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2012 event pairs, 38 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 640. Up to 109 conditions per place. [2024-11-10 14:40:01,031 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 15 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2024-11-10 14:40:01,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 274 transitions, 592 flow [2024-11-10 14:40:01,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:01,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:40:01,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:40:01,034 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 560 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:40:01,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 274 transitions, 592 flow [2024-11-10 14:40:01,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 274 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:01,039 INFO L231 Difference]: Finished difference. Result has 275 places, 274 transitions, 558 flow [2024-11-10 14:40:01,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2024-11-10 14:40:01,041 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -57 predicate places. [2024-11-10 14:40:01,041 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 558 flow [2024-11-10 14:40:01,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:01,042 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-11-10 14:40:01,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:01,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash 177639585, now seen corresponding path program 1 times [2024-11-10 14:40:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808739070] [2024-11-10 14:40:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:01,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:01,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808739070] [2024-11-10 14:40:01,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808739070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:01,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:01,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:01,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640278818] [2024-11-10 14:40:01,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:01,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:01,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:01,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:01,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:40:01,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:01,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:40:01,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:01,259 INFO L124 PetriNetUnfolderBase]: 72/575 cut-off events. [2024-11-10 14:40:01,260 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:40:01,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 575 events. 72/575 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2037 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 642. Up to 81 conditions per place. [2024-11-10 14:40:01,264 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 18 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-11-10 14:40:01,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 610 flow [2024-11-10 14:40:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2024-11-10 14:40:01,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8161559888579387 [2024-11-10 14:40:01,266 INFO L175 Difference]: Start difference. First operand has 275 places, 274 transitions, 558 flow. Second operand 3 states and 879 transitions. [2024-11-10 14:40:01,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 610 flow [2024-11-10 14:40:01,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:01,271 INFO L231 Difference]: Finished difference. Result has 275 places, 274 transitions, 562 flow [2024-11-10 14:40:01,272 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2024-11-10 14:40:01,273 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -57 predicate places. [2024-11-10 14:40:01,273 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 562 flow [2024-11-10 14:40:01,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:01,275 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-11-10 14:40:01,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:01,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:01,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash -944270791, now seen corresponding path program 1 times [2024-11-10 14:40:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041886465] [2024-11-10 14:40:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:01,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041886465] [2024-11-10 14:40:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041886465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947067753] [2024-11-10 14:40:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:01,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:01,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:01,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:01,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:01,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:01,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:01,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:01,449 INFO L124 PetriNetUnfolderBase]: 72/568 cut-off events. [2024-11-10 14:40:01,450 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2024-11-10 14:40:01,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 568 events. 72/568 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2068 event pairs, 38 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 308. Up to 110 conditions per place. [2024-11-10 14:40:01,454 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 15 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2024-11-10 14:40:01,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 273 transitions, 594 flow [2024-11-10 14:40:01,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:40:01,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:40:01,456 INFO L175 Difference]: Start difference. First operand has 275 places, 274 transitions, 562 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:40:01,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 273 transitions, 594 flow [2024-11-10 14:40:01,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 592 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:01,461 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 562 flow [2024-11-10 14:40:01,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2024-11-10 14:40:01,462 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -57 predicate places. [2024-11-10 14:40:01,462 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 562 flow [2024-11-10 14:40:01,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:01,463 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-11-10 14:40:01,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:01,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:01,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1680250383, now seen corresponding path program 1 times [2024-11-10 14:40:01,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:01,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117982475] [2024-11-10 14:40:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:01,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:01,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:01,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117982475] [2024-11-10 14:40:01,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117982475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:01,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:01,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290096473] [2024-11-10 14:40:01,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:01,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:01,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:01,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:01,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:01,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 359 [2024-11-10 14:40:01,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:01,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 359 [2024-11-10 14:40:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:01,633 INFO L124 PetriNetUnfolderBase]: 72/567 cut-off events. [2024-11-10 14:40:01,633 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2024-11-10 14:40:01,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 567 events. 72/567 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2066 event pairs, 38 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 652. Up to 111 conditions per place. [2024-11-10 14:40:01,637 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-11-10 14:40:01,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 596 flow [2024-11-10 14:40:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2024-11-10 14:40:01,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8022284122562674 [2024-11-10 14:40:01,640 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 562 flow. Second operand 3 states and 864 transitions. [2024-11-10 14:40:01,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 596 flow [2024-11-10 14:40:01,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 272 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:01,647 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 560 flow [2024-11-10 14:40:01,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, 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=560, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2024-11-10 14:40:01,650 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -58 predicate places. [2024-11-10 14:40:01,650 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 560 flow [2024-11-10 14:40:01,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.3333333333333) internal successors, (850), 3 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:01,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:01,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:01,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:01,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:01,652 INFO L85 PathProgramCache]: Analyzing trace with hash -565503418, now seen corresponding path program 1 times [2024-11-10 14:40:01,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045098835] [2024-11-10 14:40:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045098835] [2024-11-10 14:40:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045098835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:01,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954599099] [2024-11-10 14:40:01,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:01,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:40:01,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:01,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:40:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:01,836 INFO L124 PetriNetUnfolderBase]: 83/694 cut-off events. [2024-11-10 14:40:01,836 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-10 14:40:01,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 694 events. 83/694 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2919 event pairs, 20 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 781. Up to 66 conditions per place. [2024-11-10 14:40:01,841 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 21 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-11-10 14:40:01,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 279 transitions, 626 flow [2024-11-10 14:40:01,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:01,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 880 transitions. [2024-11-10 14:40:01,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8170844939647168 [2024-11-10 14:40:01,844 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 560 flow. Second operand 3 states and 880 transitions. [2024-11-10 14:40:01,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 279 transitions, 626 flow [2024-11-10 14:40:01,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 279 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:01,849 INFO L231 Difference]: Finished difference. Result has 274 places, 272 transitions, 564 flow [2024-11-10 14:40:01,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=274, PETRI_TRANSITIONS=272} [2024-11-10 14:40:01,850 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -58 predicate places. [2024-11-10 14:40:01,851 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 272 transitions, 564 flow [2024-11-10 14:40:01,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:01,852 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-11-10 14:40:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:01,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:01,855 INFO L85 PathProgramCache]: Analyzing trace with hash 889816096, now seen corresponding path program 1 times [2024-11-10 14:40:01,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164673113] [2024-11-10 14:40:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:01,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:01,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164673113] [2024-11-10 14:40:01,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164673113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:01,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:01,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808277496] [2024-11-10 14:40:01,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:01,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:01,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:01,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:01,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:01,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:02,025 INFO L124 PetriNetUnfolderBase]: 83/582 cut-off events. [2024-11-10 14:40:02,025 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2024-11-10 14:40:02,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 582 events. 83/582 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2127 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 463. Up to 123 conditions per place. [2024-11-10 14:40:02,029 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-11-10 14:40:02,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 271 transitions, 598 flow [2024-11-10 14:40:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:02,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:40:02,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:40:02,032 INFO L175 Difference]: Start difference. First operand has 274 places, 272 transitions, 564 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:40:02,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 271 transitions, 598 flow [2024-11-10 14:40:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 271 transitions, 596 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:02,038 INFO L231 Difference]: Finished difference. Result has 274 places, 271 transitions, 564 flow [2024-11-10 14:40:02,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=272, 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=564, PETRI_PLACES=274, PETRI_TRANSITIONS=271} [2024-11-10 14:40:02,040 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -58 predicate places. [2024-11-10 14:40:02,040 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 271 transitions, 564 flow [2024-11-10 14:40:02,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:02,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:02,041 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:02,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -25730100, now seen corresponding path program 1 times [2024-11-10 14:40:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080896497] [2024-11-10 14:40:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080896497] [2024-11-10 14:40:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080896497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:02,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:02,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280836533] [2024-11-10 14:40:02,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:02,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:02,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:02,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:40:02,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 271 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:02,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:02,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:40:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:02,204 INFO L124 PetriNetUnfolderBase]: 83/581 cut-off events. [2024-11-10 14:40:02,204 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:40:02,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 581 events. 83/581 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2138 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 687. Up to 121 conditions per place. [2024-11-10 14:40:02,208 INFO L140 encePairwiseOnDemand]: 357/359 looper letters, 15 selfloop transitions, 1 changer transitions 0/270 dead transitions. [2024-11-10 14:40:02,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 270 transitions, 594 flow [2024-11-10 14:40:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:02,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2024-11-10 14:40:02,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8105849582172702 [2024-11-10 14:40:02,211 INFO L175 Difference]: Start difference. First operand has 274 places, 271 transitions, 564 flow. Second operand 3 states and 873 transitions. [2024-11-10 14:40:02,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 270 transitions, 594 flow [2024-11-10 14:40:02,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 270 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:02,217 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 560 flow [2024-11-10 14:40:02,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=273, PETRI_TRANSITIONS=270} [2024-11-10 14:40:02,218 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -59 predicate places. [2024-11-10 14:40:02,218 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 560 flow [2024-11-10 14:40:02,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:02,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:02,219 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] [2024-11-10 14:40:02,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:02,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:02,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:02,220 INFO L85 PathProgramCache]: Analyzing trace with hash -135524509, now seen corresponding path program 1 times [2024-11-10 14:40:02,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:02,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275122893] [2024-11-10 14:40:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:02,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275122893] [2024-11-10 14:40:02,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275122893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:02,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:02,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88193080] [2024-11-10 14:40:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:02,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:02,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:02,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:02,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:02,428 INFO L124 PetriNetUnfolderBase]: 83/580 cut-off events. [2024-11-10 14:40:02,429 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:40:02,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 580 events. 83/580 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2132 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 687. Up to 123 conditions per place. [2024-11-10 14:40:02,433 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-10 14:40:02,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 269 transitions, 594 flow [2024-11-10 14:40:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:40:02,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:40:02,436 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 560 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:40:02,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 269 transitions, 594 flow [2024-11-10 14:40:02,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 269 transitions, 593 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:02,440 INFO L231 Difference]: Finished difference. Result has 273 places, 269 transitions, 561 flow [2024-11-10 14:40:02,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=271, 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=561, PETRI_PLACES=273, PETRI_TRANSITIONS=269} [2024-11-10 14:40:02,441 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -59 predicate places. [2024-11-10 14:40:02,442 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 269 transitions, 561 flow [2024-11-10 14:40:02,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:02,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:02,443 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:02,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:02,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1195454121, now seen corresponding path program 1 times [2024-11-10 14:40:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337345386] [2024-11-10 14:40:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:02,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337345386] [2024-11-10 14:40:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337345386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:40:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152311810] [2024-11-10 14:40:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:40:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:40:02,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:40:03,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 359 [2024-11-10 14:40:03,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 269 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 359 [2024-11-10 14:40:03,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:03,128 INFO L124 PetriNetUnfolderBase]: 83/578 cut-off events. [2024-11-10 14:40:03,128 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:40:03,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 578 events. 83/578 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2125 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 709. Up to 136 conditions per place. [2024-11-10 14:40:03,133 INFO L140 encePairwiseOnDemand]: 347/359 looper letters, 29 selfloop transitions, 10 changer transitions 0/267 dead transitions. [2024-11-10 14:40:03,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 267 transitions, 635 flow [2024-11-10 14:40:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:40:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:40:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1611 transitions. [2024-11-10 14:40:03,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7479108635097493 [2024-11-10 14:40:03,136 INFO L175 Difference]: Start difference. First operand has 273 places, 269 transitions, 561 flow. Second operand 6 states and 1611 transitions. [2024-11-10 14:40:03,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 267 transitions, 635 flow [2024-11-10 14:40:03,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 267 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:03,141 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 573 flow [2024-11-10 14:40:03,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2024-11-10 14:40:03,143 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -58 predicate places. [2024-11-10 14:40:03,145 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 573 flow [2024-11-10 14:40:03,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:03,146 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] [2024-11-10 14:40:03,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:40:03,147 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash -51626633, now seen corresponding path program 1 times [2024-11-10 14:40:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:03,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780266198] [2024-11-10 14:40:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780266198] [2024-11-10 14:40:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780266198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784848720] [2024-11-10 14:40:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:03,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:40:03,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:40:03,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:03,281 INFO L124 PetriNetUnfolderBase]: 83/577 cut-off events. [2024-11-10 14:40:03,281 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:40:03,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 577 events. 83/577 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2110 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 743. Up to 121 conditions per place. [2024-11-10 14:40:03,296 INFO L140 encePairwiseOnDemand]: 357/359 looper letters, 15 selfloop transitions, 1 changer transitions 0/266 dead transitions. [2024-11-10 14:40:03,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 266 transitions, 603 flow [2024-11-10 14:40:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:03,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2024-11-10 14:40:03,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8105849582172702 [2024-11-10 14:40:03,299 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 573 flow. Second operand 3 states and 873 transitions. [2024-11-10 14:40:03,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 266 transitions, 603 flow [2024-11-10 14:40:03,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 266 transitions, 583 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:40:03,303 INFO L231 Difference]: Finished difference. Result has 270 places, 266 transitions, 553 flow [2024-11-10 14:40:03,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=268, 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=553, PETRI_PLACES=270, PETRI_TRANSITIONS=266} [2024-11-10 14:40:03,304 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -62 predicate places. [2024-11-10 14:40:03,304 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 266 transitions, 553 flow [2024-11-10 14:40:03,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.0) internal successors, (861), 3 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,305 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:03,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:03,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:03,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:03,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1283656715, now seen corresponding path program 1 times [2024-11-10 14:40:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:03,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012288618] [2024-11-10 14:40:03,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:03,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012288618] [2024-11-10 14:40:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012288618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126291538] [2024-11-10 14:40:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:03,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:03,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:03,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:03,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 266 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:03,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:03,445 INFO L124 PetriNetUnfolderBase]: 83/576 cut-off events. [2024-11-10 14:40:03,445 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2024-11-10 14:40:03,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 576 events. 83/576 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2114 event pairs, 38 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 684. Up to 123 conditions per place. [2024-11-10 14:40:03,450 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 16 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-10 14:40:03,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 265 transitions, 587 flow [2024-11-10 14:40:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-11-10 14:40:03,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8040854224698236 [2024-11-10 14:40:03,453 INFO L175 Difference]: Start difference. First operand has 270 places, 266 transitions, 553 flow. Second operand 3 states and 866 transitions. [2024-11-10 14:40:03,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 265 transitions, 587 flow [2024-11-10 14:40:03,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 265 transitions, 586 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:03,457 INFO L231 Difference]: Finished difference. Result has 270 places, 265 transitions, 554 flow [2024-11-10 14:40:03,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=270, PETRI_TRANSITIONS=265} [2024-11-10 14:40:03,458 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -62 predicate places. [2024-11-10 14:40:03,459 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 265 transitions, 554 flow [2024-11-10 14:40:03,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:03,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:03,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:03,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -26241967, now seen corresponding path program 1 times [2024-11-10 14:40:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869728530] [2024-11-10 14:40:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869728530] [2024-11-10 14:40:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869728530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686295137] [2024-11-10 14:40:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:03,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:03,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 359 [2024-11-10 14:40:03,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 265 transitions, 554 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-11-10 14:40:03,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 359 [2024-11-10 14:40:03,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:03,614 INFO L124 PetriNetUnfolderBase]: 112/691 cut-off events. [2024-11-10 14:40:03,614 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-11-10 14:40:03,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 691 events. 112/691 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3001 event pairs, 64 based on Foata normal form. 1/610 useless extension candidates. Maximal degree in co-relation 881. Up to 171 conditions per place. [2024-11-10 14:40:03,619 INFO L140 encePairwiseOnDemand]: 355/359 looper letters, 17 selfloop transitions, 1 changer transitions 2/262 dead transitions. [2024-11-10 14:40:03,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 262 transitions, 586 flow [2024-11-10 14:40:03,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 860 transitions. [2024-11-10 14:40:03,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7985143918291551 [2024-11-10 14:40:03,622 INFO L175 Difference]: Start difference. First operand has 270 places, 265 transitions, 554 flow. Second operand 3 states and 860 transitions. [2024-11-10 14:40:03,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 262 transitions, 586 flow [2024-11-10 14:40:03,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 262 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:03,626 INFO L231 Difference]: Finished difference. Result has 267 places, 260 transitions, 542 flow [2024-11-10 14:40:03,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=265, 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=542, PETRI_PLACES=267, PETRI_TRANSITIONS=260} [2024-11-10 14:40:03,627 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -65 predicate places. [2024-11-10 14:40:03,628 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 260 transitions, 542 flow [2024-11-10 14:40:03,628 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-11-10 14:40:03,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:03,629 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] [2024-11-10 14:40:03,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:03,629 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:03,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:03,630 INFO L85 PathProgramCache]: Analyzing trace with hash -832760098, now seen corresponding path program 1 times [2024-11-10 14:40:03,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:03,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473389188] [2024-11-10 14:40:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:03,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:03,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473389188] [2024-11-10 14:40:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473389188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282083435] [2024-11-10 14:40:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:03,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:03,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 359 [2024-11-10 14:40:03,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 260 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 359 [2024-11-10 14:40:03,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:03,833 INFO L124 PetriNetUnfolderBase]: 158/637 cut-off events. [2024-11-10 14:40:03,833 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-11-10 14:40:03,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 637 events. 158/637 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2442 event pairs, 53 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 883. Up to 156 conditions per place. [2024-11-10 14:40:03,838 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 20 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-10 14:40:03,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 265 transitions, 602 flow [2024-11-10 14:40:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2024-11-10 14:40:03,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8152274837511606 [2024-11-10 14:40:03,841 INFO L175 Difference]: Start difference. First operand has 267 places, 260 transitions, 542 flow. Second operand 3 states and 878 transitions. [2024-11-10 14:40:03,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 265 transitions, 602 flow [2024-11-10 14:40:03,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 265 transitions, 601 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:03,846 INFO L231 Difference]: Finished difference. Result has 265 places, 259 transitions, 543 flow [2024-11-10 14:40:03,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=265, PETRI_TRANSITIONS=259} [2024-11-10 14:40:03,847 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -67 predicate places. [2024-11-10 14:40:03,847 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 259 transitions, 543 flow [2024-11-10 14:40:03,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:03,848 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] [2024-11-10 14:40:03,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:40:03,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1669120992, now seen corresponding path program 1 times [2024-11-10 14:40:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233636743] [2024-11-10 14:40:03,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:03,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:03,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233636743] [2024-11-10 14:40:03,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233636743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:03,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:03,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814146050] [2024-11-10 14:40:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:03,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:03,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:03,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:03,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 359 [2024-11-10 14:40:03,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 259 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:03,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:03,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 359 [2024-11-10 14:40:03,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:04,052 INFO L124 PetriNetUnfolderBase]: 208/677 cut-off events. [2024-11-10 14:40:04,052 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2024-11-10 14:40:04,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 677 events. 208/677 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2646 event pairs, 83 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 1039. Up to 228 conditions per place. [2024-11-10 14:40:04,057 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 22 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-10 14:40:04,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 264 transitions, 607 flow [2024-11-10 14:40:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:40:04,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8115134633240483 [2024-11-10 14:40:04,060 INFO L175 Difference]: Start difference. First operand has 265 places, 259 transitions, 543 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:40:04,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 264 transitions, 607 flow [2024-11-10 14:40:04,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:04,065 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 541 flow [2024-11-10 14:40:04,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2024-11-10 14:40:04,066 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -68 predicate places. [2024-11-10 14:40:04,066 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 541 flow [2024-11-10 14:40:04,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:04,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:04,067 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] [2024-11-10 14:40:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:40:04,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1477409726, now seen corresponding path program 1 times [2024-11-10 14:40:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727841775] [2024-11-10 14:40:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727841775] [2024-11-10 14:40:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727841775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615107997] [2024-11-10 14:40:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:04,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:04,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:04,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:04,130 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:04,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:04,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:04,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:04,267 INFO L124 PetriNetUnfolderBase]: 167/746 cut-off events. [2024-11-10 14:40:04,267 INFO L125 PetriNetUnfolderBase]: For 92/104 co-relation queries the response was YES. [2024-11-10 14:40:04,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 746 events. 167/746 cut-off events. For 92/104 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3321 event pairs, 56 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 1019. Up to 161 conditions per place. [2024-11-10 14:40:04,272 INFO L140 encePairwiseOnDemand]: 354/359 looper letters, 20 selfloop transitions, 2 changer transitions 2/263 dead transitions. [2024-11-10 14:40:04,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 263 transitions, 605 flow [2024-11-10 14:40:04,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:40:04,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8096564531104921 [2024-11-10 14:40:04,274 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 541 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:40:04,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 263 transitions, 605 flow [2024-11-10 14:40:04,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 263 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:04,278 INFO L231 Difference]: Finished difference. Result has 262 places, 254 transitions, 532 flow [2024-11-10 14:40:04,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=262, PETRI_TRANSITIONS=254} [2024-11-10 14:40:04,279 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -70 predicate places. [2024-11-10 14:40:04,279 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 254 transitions, 532 flow [2024-11-10 14:40:04,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:04,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:04,280 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:04,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:40:04,280 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2024-11-10 14:40:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2049404676, now seen corresponding path program 1 times [2024-11-10 14:40:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838169754] [2024-11-10 14:40:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838169754] [2024-11-10 14:40:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838169754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:04,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:04,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356537335] [2024-11-10 14:40:04,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:04,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:04,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:04,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 359 [2024-11-10 14:40:04,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 254 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:04,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:04,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 359 [2024-11-10 14:40:04,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:04,479 INFO L124 PetriNetUnfolderBase]: 223/815 cut-off events. [2024-11-10 14:40:04,480 INFO L125 PetriNetUnfolderBase]: For 131/157 co-relation queries the response was YES. [2024-11-10 14:40:04,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 815 events. 223/815 cut-off events. For 131/157 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3711 event pairs, 92 based on Foata normal form. 0/752 useless extension candidates. Maximal degree in co-relation 1190. Up to 242 conditions per place. [2024-11-10 14:40:04,483 INFO L140 encePairwiseOnDemand]: 356/359 looper letters, 0 selfloop transitions, 0 changer transitions 260/260 dead transitions. [2024-11-10 14:40:04,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 260 transitions, 598 flow [2024-11-10 14:40:04,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2024-11-10 14:40:04,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8087279480037141 [2024-11-10 14:40:04,485 INFO L175 Difference]: Start difference. First operand has 262 places, 254 transitions, 532 flow. Second operand 3 states and 871 transitions. [2024-11-10 14:40:04,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 260 transitions, 598 flow [2024-11-10 14:40:04,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 260 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:04,489 INFO L231 Difference]: Finished difference. Result has 259 places, 0 transitions, 0 flow [2024-11-10 14:40:04,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=259, PETRI_TRANSITIONS=0} [2024-11-10 14:40:04,490 INFO L277 CegarLoopForPetriNet]: 332 programPoint places, -73 predicate places. [2024-11-10 14:40:04,490 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 0 transitions, 0 flow [2024-11-10 14:40:04,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:40:04,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2024-11-10 14:40:04,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2024-11-10 14:40:04,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2024-11-10 14:40:04,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2024-11-10 14:40:04,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2024-11-10 14:40:04,495 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2024-11-10 14:40:04,496 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2024-11-10 14:40:04,497 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2024-11-10 14:40:04,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2024-11-10 14:40:04,499 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2024-11-10 14:40:04,500 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2024-11-10 14:40:04,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2024-11-10 14:40:04,502 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2024-11-10 14:40:04,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2024-11-10 14:40:04,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2024-11-10 14:40:04,505 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2024-11-10 14:40:04,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2024-11-10 14:40:04,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2024-11-10 14:40:04,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2024-11-10 14:40:04,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2024-11-10 14:40:04,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2024-11-10 14:40:04,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2024-11-10 14:40:04,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2024-11-10 14:40:04,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2024-11-10 14:40:04,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2024-11-10 14:40:04,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2024-11-10 14:40:04,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:40:04,512 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:04,519 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:40:04,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:04,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:04 BasicIcfg [2024-11-10 14:40:04,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:04,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:04,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:04,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:04,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:59" (3/4) ... [2024-11-10 14:40:04,528 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:40:04,530 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:40:04,531 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:40:04,531 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:40:04,537 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-11-10 14:40:04,538 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:40:04,538 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:40:04,539 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:40:04,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:04,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:40:04,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:04,649 INFO L158 Benchmark]: Toolchain (without parser) took 7208.96ms. Allocated memory was 176.2MB in the beginning and 320.9MB in the end (delta: 144.7MB). Free memory was 121.7MB in the beginning and 102.3MB in the end (delta: 19.4MB). Peak memory consumption was 169.0MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,650 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:04,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.05ms. Allocated memory is still 176.2MB. Free memory was 121.7MB in the beginning and 106.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.17ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 102.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,650 INFO L158 Benchmark]: Boogie Preprocessor took 46.44ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 100.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,651 INFO L158 Benchmark]: IcfgBuilder took 1405.22ms. Allocated memory is still 176.2MB. Free memory was 100.0MB in the beginning and 92.7MB in the end (delta: 7.3MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,651 INFO L158 Benchmark]: TraceAbstraction took 5259.48ms. Allocated memory was 176.2MB in the beginning and 320.9MB in the end (delta: 144.7MB). Free memory was 91.6MB in the beginning and 108.6MB in the end (delta: -17.0MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,651 INFO L158 Benchmark]: Witness Printer took 123.18ms. Allocated memory is still 320.9MB. Free memory was 108.6MB in the beginning and 102.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:40:04,653 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.21ms. Allocated memory is still 176.2MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.05ms. Allocated memory is still 176.2MB. Free memory was 121.7MB in the beginning and 106.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.17ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 102.5MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.44ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 100.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1405.22ms. Allocated memory is still 176.2MB. Free memory was 100.0MB in the beginning and 92.7MB in the end (delta: 7.3MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5259.48ms. Allocated memory was 176.2MB in the beginning and 320.9MB in the end (delta: 144.7MB). Free memory was 91.6MB in the beginning and 108.6MB in the end (delta: -17.0MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 123.18ms. Allocated memory is still 320.9MB. Free memory was 108.6MB in the beginning and 102.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 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: 113]: 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: 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, 441 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: 5.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 50 mSDtfsCounter, 734 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=696occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1896 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 2028 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-11-10 14:40:04,685 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