./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version a046e57d
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.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 f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m
[2024-10-13 09:56:22,168 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-13 09:56:22,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-10-13 09:56:22,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-13 09:56:22,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-13 09:56:22,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-13 09:56:22,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-13 09:56:22,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-13 09:56:22,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-13 09:56:22,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-13 09:56:22,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-13 09:56:22,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-13 09:56:22,297 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-13 09:56:22,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-13 09:56:22,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-13 09:56:22,298 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-13 09:56:22,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-13 09:56:22,298 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-13 09:56:22,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-13 09:56:22,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-13 09:56:22,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-13 09:56:22,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-13 09:56:22,301 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-10-13 09:56:22,301 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-13 09:56:22,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-13 09:56:22,302 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-13 09:56:22,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-13 09:56:22,302 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-13 09:56:22,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-13 09:56:22,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-13 09:56:22,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-13 09:56:22,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 09:56:22,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-13 09:56:22,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-13 09:56:22,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-13 09:56:22,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-13 09:56:22,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-13 09:56:22,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-13 09:56:22,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-13 09:56:22,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-13 09:56:22,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-13 09:56:22,307 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 -> f25d9c7e70f7f3d19e85c7cfc6427443102f5451f704dd6a19dd9a78d021a612
[2024-10-13 09:56:22,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-13 09:56:22,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-13 09:56:22,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-13 09:56:22,617 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-13 09:56:22,617 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-13 09:56:22,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c
[2024-10-13 09:56:24,144 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-13 09:56:24,346 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-13 09:56:24,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c
[2024-10-13 09:56:24,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e33dd3b/beda342acf5b4ccab1562f622431791f/FLAGd796f1ecd
[2024-10-13 09:56:24,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e33dd3b/beda342acf5b4ccab1562f622431791f
[2024-10-13 09:56:24,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-13 09:56:24,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-13 09:56:24,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-13 09:56:24,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-13 09:56:24,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-13 09:56:24,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41868a9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24, skipping insertion in model container
[2024-10-13 09:56:24,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,399 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-13 09:56:24,640 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 09:56:24,654 INFO L200 MainTranslator]: Completed pre-run
[2024-10-13 09:56:24,687 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 09:56:24,703 INFO L204 MainTranslator]: Completed translation
[2024-10-13 09:56:24,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24 WrapperNode
[2024-10-13 09:56:24,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-13 09:56:24,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-13 09:56:24,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-13 09:56:24,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-13 09:56:24,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,738 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129
[2024-10-13 09:56:24,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-13 09:56:24,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-13 09:56:24,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-13 09:56:24,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-13 09:56:24,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-13 09:56:24,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-13 09:56:24,773 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-13 09:56:24,773 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-13 09:56:24,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (1/1) ...
[2024-10-13 09:56:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 09:56:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 09:56:24,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-13 09:56:24,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-13 09:56:24,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-13 09:56:24,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread1
[2024-10-13 09:56:24,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1
[2024-10-13 09:56:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread2
[2024-10-13 09:56:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2
[2024-10-13 09:56:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread3
[2024-10-13 09:56:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3
[2024-10-13 09:56:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread4
[2024-10-13 09:56:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4
[2024-10-13 09:56:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-13 09:56:24,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-13 09:56:24,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-13 09:56:24,861 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-13 09:56:24,963 INFO L238 CfgBuilder]: Building ICFG
[2024-10-13 09:56:24,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-13 09:56:25,332 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-13 09:56:25,336 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-13 09:56:25,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-13 09:56:25,367 INFO L314 CfgBuilder]: Removed 4 assume(true) statements.
[2024-10-13 09:56:25,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:25 BoogieIcfgContainer
[2024-10-13 09:56:25,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-13 09:56:25,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-13 09:56:25,370 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-13 09:56:25,374 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-13 09:56:25,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:56:24" (1/3) ...
[2024-10-13 09:56:25,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f88595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:25, skipping insertion in model container
[2024-10-13 09:56:25,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:56:24" (2/3) ...
[2024-10-13 09:56:25,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f88595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:56:25, skipping insertion in model container
[2024-10-13 09:56:25,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:25" (3/3) ...
[2024-10-13 09:56:25,377 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c
[2024-10-13 09:56:25,394 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-13 09:56:25,394 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations.
[2024-10-13 09:56:25,395 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-13 09:56:25,503 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-10-13 09:56:25,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 259 transitions, 546 flow
[2024-10-13 09:56:25,633 INFO L124 PetriNetUnfolderBase]: 14/255 cut-off events.
[2024-10-13 09:56:25,633 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-10-13 09:56:25,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 255 events. 14/255 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place.
[2024-10-13 09:56:25,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 259 transitions, 546 flow
[2024-10-13 09:56:25,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 236 places, 235 transitions, 494 flow
[2024-10-13 09:56:25,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-13 09:56:25,678 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;@3caedef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-13 09:56:25,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations.
[2024-10-13 09:56:25,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-10-13 09:56:25,687 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events.
[2024-10-13 09:56:25,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-10-13 09:56:25,690 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:25,691 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]
[2024-10-13 09:56:25,691 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:25,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash 380133642, now seen corresponding path program 1 times
[2024-10-13 09:56:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787043688]
[2024-10-13 09:56:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:25,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787043688]
[2024-10-13 09:56:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787043688] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:25,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77723476]
[2024-10-13 09:56:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:25,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:25,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:26,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259
[2024-10-13 09:56:26,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 235 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:26,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259
[2024-10-13 09:56:26,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:26,144 INFO L124 PetriNetUnfolderBase]: 22/310 cut-off events.
[2024-10-13 09:56:26,145 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-10-13 09:56:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 310 events. 22/310 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 986 event pairs, 12 based on Foata normal form. 37/285 useless extension candidates. Maximal degree in co-relation 294. Up to 46 conditions per place.
[2024-10-13 09:56:26,152 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 18 selfloop transitions, 2 changer transitions 1/229 dead transitions.
[2024-10-13 09:56:26,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 229 transitions, 522 flow
[2024-10-13 09:56:26,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:26,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions.
[2024-10-13 09:56:26,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215
[2024-10-13 09:56:26,174 INFO L175 Difference]: Start difference. First operand has 236 places, 235 transitions, 494 flow. Second operand 3 states and 716 transitions.
[2024-10-13 09:56:26,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 229 transitions, 522 flow
[2024-10-13 09:56:26,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 229 transitions, 506 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-10-13 09:56:26,186 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 468 flow
[2024-10-13 09:56:26,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=229, PETRI_TRANSITIONS=228}
[2024-10-13 09:56:26,194 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -7 predicate places.
[2024-10-13 09:56:26,195 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 468 flow
[2024-10-13 09:56:26,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,196 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:26,196 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]
[2024-10-13 09:56:26,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-13 09:56:26,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:26,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:26,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1582249989, now seen corresponding path program 1 times
[2024-10-13 09:56:26,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:26,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339426041]
[2024-10-13 09:56:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339426041]
[2024-10-13 09:56:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339426041] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:26,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:26,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091111654]
[2024-10-13 09:56:26,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:26,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:26,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:26,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:26,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259
[2024-10-13 09:56:26,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:26,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259
[2024-10-13 09:56:26,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:26,477 INFO L124 PetriNetUnfolderBase]: 22/308 cut-off events.
[2024-10-13 09:56:26,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-10-13 09:56:26,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 308 events. 22/308 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 918 event pairs, 12 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 341. Up to 45 conditions per place.
[2024-10-13 09:56:26,485 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/227 dead transitions.
[2024-10-13 09:56:26,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 227 transitions, 504 flow
[2024-10-13 09:56:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions.
[2024-10-13 09:56:26,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176
[2024-10-13 09:56:26,492 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 468 flow. Second operand 3 states and 713 transitions.
[2024-10-13 09:56:26,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 227 transitions, 504 flow
[2024-10-13 09:56:26,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:26,500 INFO L231 Difference]: Finished difference. Result has 227 places, 227 transitions, 466 flow
[2024-10-13 09:56:26,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=227}
[2024-10-13 09:56:26,501 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -9 predicate places.
[2024-10-13 09:56:26,502 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 227 transitions, 466 flow
[2024-10-13 09:56:26,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,503 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:26,504 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:26,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-13 09:56:26,504 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:26,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1361925789, now seen corresponding path program 1 times
[2024-10-13 09:56:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:26,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046807519]
[2024-10-13 09:56:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:26,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046807519]
[2024-10-13 09:56:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046807519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828147202]
[2024-10-13 09:56:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:26,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 259
[2024-10-13 09:56:26,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 227 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:26,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 259
[2024-10-13 09:56:26,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:26,701 INFO L124 PetriNetUnfolderBase]: 22/289 cut-off events.
[2024-10-13 09:56:26,702 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-10-13 09:56:26,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 289 events. 22/289 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 773 event pairs, 12 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 312. Up to 46 conditions per place.
[2024-10-13 09:56:26,706 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/226 dead transitions.
[2024-10-13 09:56:26,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 504 flow
[2024-10-13 09:56:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions.
[2024-10-13 09:56:26,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915057915057915
[2024-10-13 09:56:26,710 INFO L175 Difference]: Start difference. First operand has 227 places, 227 transitions, 466 flow. Second operand 3 states and 711 transitions.
[2024-10-13 09:56:26,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 504 flow
[2024-10-13 09:56:26,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 226 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:26,715 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 464 flow
[2024-10-13 09:56:26,715 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=226}
[2024-10-13 09:56:26,716 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -10 predicate places.
[2024-10-13 09:56:26,717 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 464 flow
[2024-10-13 09:56:26,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,718 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:26,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:26,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-13 09:56:26,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:26,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:26,720 INFO L85 PathProgramCache]: Analyzing trace with hash 867166823, now seen corresponding path program 1 times
[2024-10-13 09:56:26,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526008595]
[2024-10-13 09:56:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:26,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526008595]
[2024-10-13 09:56:26,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526008595] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:26,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:26,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845275286]
[2024-10-13 09:56:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:26,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:26,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:26,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259
[2024-10-13 09:56:26,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:26,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259
[2024-10-13 09:56:26,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:26,864 INFO L124 PetriNetUnfolderBase]: 22/270 cut-off events.
[2024-10-13 09:56:26,864 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2024-10-13 09:56:26,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 270 events. 22/270 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 619 event pairs, 12 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 281. Up to 45 conditions per place.
[2024-10-13 09:56:26,866 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 17 selfloop transitions, 2 changer transitions 0/225 dead transitions.
[2024-10-13 09:56:26,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 500 flow
[2024-10-13 09:56:26,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions.
[2024-10-13 09:56:26,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176
[2024-10-13 09:56:26,869 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 464 flow. Second operand 3 states and 713 transitions.
[2024-10-13 09:56:26,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 500 flow
[2024-10-13 09:56:26,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 225 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:26,872 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 462 flow
[2024-10-13 09:56:26,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=225}
[2024-10-13 09:56:26,874 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -11 predicate places.
[2024-10-13 09:56:26,874 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 462 flow
[2024-10-13 09:56:26,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,874 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:26,875 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-13 09:56:26,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:26,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2011416729, now seen corresponding path program 1 times
[2024-10-13 09:56:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568012947]
[2024-10-13 09:56:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:26,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:26,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:26,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568012947]
[2024-10-13 09:56:26,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568012947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:26,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:26,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:26,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657000224]
[2024-10-13 09:56:26,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:26,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:26,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:26,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259
[2024-10-13 09:56:26,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:26,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:26,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259
[2024-10-13 09:56:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:27,107 INFO L124 PetriNetUnfolderBase]: 102/982 cut-off events.
[2024-10-13 09:56:27,108 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES.
[2024-10-13 09:56:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 982 events. 102/982 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6241 event pairs, 51 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 1096. Up to 144 conditions per place.
[2024-10-13 09:56:27,154 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 15 selfloop transitions, 2 changer transitions 0/224 dead transitions.
[2024-10-13 09:56:27,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 224 transitions, 494 flow
[2024-10-13 09:56:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:27,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions.
[2024-10-13 09:56:27,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228
[2024-10-13 09:56:27,158 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 462 flow. Second operand 3 states and 717 transitions.
[2024-10-13 09:56:27,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 224 transitions, 494 flow
[2024-10-13 09:56:27,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 224 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:27,162 INFO L231 Difference]: Finished difference. Result has 224 places, 224 transitions, 460 flow
[2024-10-13 09:56:27,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=224}
[2024-10-13 09:56:27,165 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -12 predicate places.
[2024-10-13 09:56:27,166 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 224 transitions, 460 flow
[2024-10-13 09:56:27,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,167 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:27,167 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]
[2024-10-13 09:56:27,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-13 09:56:27,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash -636728045, now seen corresponding path program 1 times
[2024-10-13 09:56:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326663305]
[2024-10-13 09:56:27,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:27,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326663305]
[2024-10-13 09:56:27,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326663305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:27,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:27,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:27,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488540398]
[2024-10-13 09:56:27,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:27,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:27,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:27,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:27,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:27,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259
[2024-10-13 09:56:27,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 224 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:27,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259
[2024-10-13 09:56:27,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:27,321 INFO L124 PetriNetUnfolderBase]: 31/300 cut-off events.
[2024-10-13 09:56:27,321 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-10-13 09:56:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 300 events. 31/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1000 event pairs, 18 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 340. Up to 60 conditions per place.
[2024-10-13 09:56:27,325 INFO L140 encePairwiseOnDemand]: 250/259 looper letters, 23 selfloop transitions, 3 changer transitions 0/222 dead transitions.
[2024-10-13 09:56:27,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 222 transitions, 511 flow
[2024-10-13 09:56:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions.
[2024-10-13 09:56:27,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9060489060489061
[2024-10-13 09:56:27,328 INFO L175 Difference]: Start difference. First operand has 224 places, 224 transitions, 460 flow. Second operand 3 states and 704 transitions.
[2024-10-13 09:56:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 222 transitions, 511 flow
[2024-10-13 09:56:27,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 222 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:27,333 INFO L231 Difference]: Finished difference. Result has 219 places, 219 transitions, 457 flow
[2024-10-13 09:56:27,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=219, PETRI_TRANSITIONS=219}
[2024-10-13 09:56:27,334 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places.
[2024-10-13 09:56:27,335 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 457 flow
[2024-10-13 09:56:27,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,336 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:27,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:27,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-13 09:56:27,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:27,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2010283632, now seen corresponding path program 1 times
[2024-10-13 09:56:27,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:27,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881595389]
[2024-10-13 09:56:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881595389]
[2024-10-13 09:56:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881595389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:27,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:27,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:27,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69607092]
[2024-10-13 09:56:27,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:27,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:27,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:27,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:27,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:27,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259
[2024-10-13 09:56:27,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:27,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259
[2024-10-13 09:56:27,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:27,486 INFO L124 PetriNetUnfolderBase]: 31/296 cut-off events.
[2024-10-13 09:56:27,486 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2024-10-13 09:56:27,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 296 events. 31/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 955 event pairs, 18 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 322. Up to 58 conditions per place.
[2024-10-13 09:56:27,490 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 21 selfloop transitions, 3 changer transitions 0/218 dead transitions.
[2024-10-13 09:56:27,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow
[2024-10-13 09:56:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions.
[2024-10-13 09:56:27,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9137709137709138
[2024-10-13 09:56:27,493 INFO L175 Difference]: Start difference. First operand has 219 places, 219 transitions, 457 flow. Second operand 3 states and 710 transitions.
[2024-10-13 09:56:27,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow
[2024-10-13 09:56:27,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 218 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-10-13 09:56:27,497 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 457 flow
[2024-10-13 09:56:27,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=216, PETRI_TRANSITIONS=215}
[2024-10-13 09:56:27,498 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -20 predicate places.
[2024-10-13 09:56:27,499 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 457 flow
[2024-10-13 09:56:27,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,499 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:27,500 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]
[2024-10-13 09:56:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-13 09:56:27,500 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:27,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1525805944, now seen corresponding path program 1 times
[2024-10-13 09:56:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131408645]
[2024-10-13 09:56:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:27,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131408645]
[2024-10-13 09:56:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131408645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:27,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237902679]
[2024-10-13 09:56:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:27,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:27,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 259
[2024-10-13 09:56:27,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:27,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 259
[2024-10-13 09:56:27,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:27,661 INFO L124 PetriNetUnfolderBase]: 39/409 cut-off events.
[2024-10-13 09:56:27,661 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES.
[2024-10-13 09:56:27,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 409 events. 39/409 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1619 event pairs, 15 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 444. Up to 64 conditions per place.
[2024-10-13 09:56:27,666 INFO L140 encePairwiseOnDemand]: 249/259 looper letters, 26 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-10-13 09:56:27,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 217 transitions, 527 flow
[2024-10-13 09:56:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions.
[2024-10-13 09:56:27,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9111969111969112
[2024-10-13 09:56:27,668 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 457 flow. Second operand 3 states and 708 transitions.
[2024-10-13 09:56:27,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 217 transitions, 527 flow
[2024-10-13 09:56:27,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-10-13 09:56:27,673 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 462 flow
[2024-10-13 09:56:27,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=212, PETRI_TRANSITIONS=211}
[2024-10-13 09:56:27,676 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places.
[2024-10-13 09:56:27,676 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 462 flow
[2024-10-13 09:56:27,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,677 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:27,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:27,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-13 09:56:27,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1715679788, now seen corresponding path program 1 times
[2024-10-13 09:56:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009731002]
[2024-10-13 09:56:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:27,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:27,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009731002]
[2024-10-13 09:56:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009731002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 09:56:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69708217]
[2024-10-13 09:56:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:27,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-13 09:56:27,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:27,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-13 09:56:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 09:56:27,796 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259
[2024-10-13 09:56:27,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:27,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259
[2024-10-13 09:56:27,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:27,883 INFO L124 PetriNetUnfolderBase]: 12/347 cut-off events.
[2024-10-13 09:56:27,883 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-10-13 09:56:27,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 347 events. 12/347 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1119 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 291. Up to 26 conditions per place.
[2024-10-13 09:56:27,886 INFO L140 encePairwiseOnDemand]: 253/259 looper letters, 19 selfloop transitions, 5 changer transitions 0/216 dead transitions.
[2024-10-13 09:56:27,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 520 flow
[2024-10-13 09:56:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 09:56:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-10-13 09:56:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1185 transitions.
[2024-10-13 09:56:27,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915057915057915
[2024-10-13 09:56:27,889 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 462 flow. Second operand 5 states and 1185 transitions.
[2024-10-13 09:56:27,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 520 flow
[2024-10-13 09:56:27,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 516 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-10-13 09:56:27,893 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 496 flow
[2024-10-13 09:56:27,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=496, PETRI_PLACES=219, PETRI_TRANSITIONS=215}
[2024-10-13 09:56:27,895 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -17 predicate places.
[2024-10-13 09:56:27,895 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 496 flow
[2024-10-13 09:56:27,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.25) internal successors, (933), 4 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,896 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:27,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:27,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-13 09:56:27,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:27,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1660716693, now seen corresponding path program 1 times
[2024-10-13 09:56:27,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:27,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210230562]
[2024-10-13 09:56:27,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:27,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210230562]
[2024-10-13 09:56:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210230562] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:27,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144544525]
[2024-10-13 09:56:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:27,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:27,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 259
[2024-10-13 09:56:27,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:27,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:27,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 259
[2024-10-13 09:56:27,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:28,054 INFO L124 PetriNetUnfolderBase]: 58/561 cut-off events.
[2024-10-13 09:56:28,054 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES.
[2024-10-13 09:56:28,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 561 events. 58/561 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2829 event pairs, 5 based on Foata normal form. 1/517 useless extension candidates. Maximal degree in co-relation 497. Up to 92 conditions per place.
[2024-10-13 09:56:28,059 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 22 selfloop transitions, 3 changer transitions 10/218 dead transitions.
[2024-10-13 09:56:28,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 563 flow
[2024-10-13 09:56:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions.
[2024-10-13 09:56:28,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176319176319176
[2024-10-13 09:56:28,062 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 496 flow. Second operand 3 states and 713 transitions.
[2024-10-13 09:56:28,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 563 flow
[2024-10-13 09:56:28,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-10-13 09:56:28,066 INFO L231 Difference]: Finished difference. Result has 217 places, 201 transitions, 478 flow
[2024-10-13 09:56:28,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=217, PETRI_TRANSITIONS=201}
[2024-10-13 09:56:28,068 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -19 predicate places.
[2024-10-13 09:56:28,068 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 201 transitions, 478 flow
[2024-10-13 09:56:28,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:28,069 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:28,069 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]
[2024-10-13 09:56:28,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-13 09:56:28,069 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:28,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1694666292, now seen corresponding path program 1 times
[2024-10-13 09:56:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932727166]
[2024-10-13 09:56:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:28,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:28,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932727166]
[2024-10-13 09:56:28,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932727166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:28,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:28,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:28,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821412673]
[2024-10-13 09:56:28,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:28,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:28,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:28,164 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 259
[2024-10-13 09:56:28,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 201 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:28,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:28,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 259
[2024-10-13 09:56:28,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:28,731 INFO L124 PetriNetUnfolderBase]: 746/4032 cut-off events.
[2024-10-13 09:56:28,731 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES.
[2024-10-13 09:56:28,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5626 conditions, 4032 events. 746/4032 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 40391 event pairs, 276 based on Foata normal form. 0/3540 useless extension candidates. Maximal degree in co-relation 4163. Up to 1027 conditions per place.
[2024-10-13 09:56:28,764 INFO L140 encePairwiseOnDemand]: 251/259 looper letters, 19 selfloop transitions, 4 changer transitions 0/204 dead transitions.
[2024-10-13 09:56:28,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 204 transitions, 533 flow
[2024-10-13 09:56:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions.
[2024-10-13 09:56:28,768 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9266409266409267
[2024-10-13 09:56:28,768 INFO L175 Difference]: Start difference. First operand has 217 places, 201 transitions, 478 flow. Second operand 3 states and 720 transitions.
[2024-10-13 09:56:28,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 204 transitions, 533 flow
[2024-10-13 09:56:28,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 204 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-10-13 09:56:28,779 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 495 flow
[2024-10-13 09:56:28,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=201}
[2024-10-13 09:56:28,780 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places.
[2024-10-13 09:56:28,780 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 495 flow
[2024-10-13 09:56:28,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:28,781 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:28,781 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]
[2024-10-13 09:56:28,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-13 09:56:28,781 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:28,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1911111425, now seen corresponding path program 1 times
[2024-10-13 09:56:28,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:28,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128190868]
[2024-10-13 09:56:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:28,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128190868]
[2024-10-13 09:56:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128190868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:28,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759083951]
[2024-10-13 09:56:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:28,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:28,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259
[2024-10-13 09:56:28,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:28,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:28,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259
[2024-10-13 09:56:28,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:29,088 INFO L124 PetriNetUnfolderBase]: 203/1313 cut-off events.
[2024-10-13 09:56:29,088 INFO L125 PetriNetUnfolderBase]: For 23/35 co-relation queries the response was YES.
[2024-10-13 09:56:29,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1313 events. 203/1313 cut-off events. For 23/35 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9893 event pairs, 64 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1269. Up to 174 conditions per place.
[2024-10-13 09:56:29,104 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 19 selfloop transitions, 2 changer transitions 0/203 dead transitions.
[2024-10-13 09:56:29,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 203 transitions, 544 flow
[2024-10-13 09:56:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions.
[2024-10-13 09:56:29,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228
[2024-10-13 09:56:29,107 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 495 flow. Second operand 3 states and 717 transitions.
[2024-10-13 09:56:29,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 203 transitions, 544 flow
[2024-10-13 09:56:29,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 203 transitions, 544 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-10-13 09:56:29,111 INFO L231 Difference]: Finished difference. Result has 206 places, 200 transitions, 497 flow
[2024-10-13 09:56:29,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=206, PETRI_TRANSITIONS=200}
[2024-10-13 09:56:29,113 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -30 predicate places.
[2024-10-13 09:56:29,113 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 200 transitions, 497 flow
[2024-10-13 09:56:29,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,114 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:29,114 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]
[2024-10-13 09:56:29,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-13 09:56:29,114 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:29,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1146972340, now seen corresponding path program 1 times
[2024-10-13 09:56:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351323131]
[2024-10-13 09:56:29,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:29,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:29,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351323131]
[2024-10-13 09:56:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351323131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440427711]
[2024-10-13 09:56:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:29,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259
[2024-10-13 09:56:29,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 200 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:29,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259
[2024-10-13 09:56:29,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:29,476 INFO L124 PetriNetUnfolderBase]: 314/1609 cut-off events.
[2024-10-13 09:56:29,476 INFO L125 PetriNetUnfolderBase]: For 88/96 co-relation queries the response was YES.
[2024-10-13 09:56:29,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1609 events. 314/1609 cut-off events. For 88/96 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12797 event pairs, 121 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 2449. Up to 298 conditions per place.
[2024-10-13 09:56:29,503 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 18 selfloop transitions, 2 changer transitions 0/202 dead transitions.
[2024-10-13 09:56:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 202 transitions, 544 flow
[2024-10-13 09:56:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions.
[2024-10-13 09:56:29,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254
[2024-10-13 09:56:29,508 INFO L175 Difference]: Start difference. First operand has 206 places, 200 transitions, 497 flow. Second operand 3 states and 719 transitions.
[2024-10-13 09:56:29,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 202 transitions, 544 flow
[2024-10-13 09:56:29,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 202 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:29,514 INFO L231 Difference]: Finished difference. Result has 205 places, 199 transitions, 495 flow
[2024-10-13 09:56:29,514 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=205, PETRI_TRANSITIONS=199}
[2024-10-13 09:56:29,515 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -31 predicate places.
[2024-10-13 09:56:29,515 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 199 transitions, 495 flow
[2024-10-13 09:56:29,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,516 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:29,516 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]
[2024-10-13 09:56:29,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-13 09:56:29,517 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:29,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -126275455, now seen corresponding path program 1 times
[2024-10-13 09:56:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:29,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552883090]
[2024-10-13 09:56:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:29,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:29,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552883090]
[2024-10-13 09:56:29,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552883090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:29,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:29,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:29,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177267052]
[2024-10-13 09:56:29,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:29,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:29,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:29,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:29,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:29,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 259
[2024-10-13 09:56:29,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 199 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:29,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 259
[2024-10-13 09:56:29,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:29,804 INFO L124 PetriNetUnfolderBase]: 228/1269 cut-off events.
[2024-10-13 09:56:29,804 INFO L125 PetriNetUnfolderBase]: For 95/98 co-relation queries the response was YES.
[2024-10-13 09:56:29,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1269 events. 228/1269 cut-off events. For 95/98 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9034 event pairs, 80 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1803. Up to 228 conditions per place.
[2024-10-13 09:56:29,816 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 20 selfloop transitions, 2 changer transitions 0/201 dead transitions.
[2024-10-13 09:56:29,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 201 transitions, 546 flow
[2024-10-13 09:56:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions.
[2024-10-13 09:56:29,819 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9227799227799228
[2024-10-13 09:56:29,819 INFO L175 Difference]: Start difference. First operand has 205 places, 199 transitions, 495 flow. Second operand 3 states and 717 transitions.
[2024-10-13 09:56:29,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 201 transitions, 546 flow
[2024-10-13 09:56:29,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:29,824 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 493 flow
[2024-10-13 09:56:29,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=204, PETRI_TRANSITIONS=198}
[2024-10-13 09:56:29,825 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -32 predicate places.
[2024-10-13 09:56:29,826 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 493 flow
[2024-10-13 09:56:29,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,827 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-10-13 09:56:29,827 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]
[2024-10-13 09:56:29,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-13 09:56:29,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 55 more)] ===
[2024-10-13 09:56:29,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 09:56:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1685758376, now seen corresponding path program 1 times
[2024-10-13 09:56:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 09:56:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671633730]
[2024-10-13 09:56:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 09:56:29,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 09:56:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 09:56:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 09:56:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 09:56:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671633730]
[2024-10-13 09:56:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671633730] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 09:56:29,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 09:56:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 09:56:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848637272]
[2024-10-13 09:56:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 09:56:29,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-13 09:56:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 09:56:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-13 09:56:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-13 09:56:29,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 259
[2024-10-13 09:56:29,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:29,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-10-13 09:56:29,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 259
[2024-10-13 09:56:29,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-10-13 09:56:30,037 INFO L124 PetriNetUnfolderBase]: 145/1013 cut-off events.
[2024-10-13 09:56:30,039 INFO L125 PetriNetUnfolderBase]: For 75/82 co-relation queries the response was YES.
[2024-10-13 09:56:30,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1013 events. 145/1013 cut-off events. For 75/82 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6559 event pairs, 39 based on Foata normal form. 1/936 useless extension candidates. Maximal degree in co-relation 1332. Up to 128 conditions per place.
[2024-10-13 09:56:30,048 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 0 selfloop transitions, 0 changer transitions 200/200 dead transitions.
[2024-10-13 09:56:30,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 200 transitions, 540 flow
[2024-10-13 09:56:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-13 09:56:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-10-13 09:56:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions.
[2024-10-13 09:56:30,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253539253539254
[2024-10-13 09:56:30,051 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 493 flow. Second operand 3 states and 719 transitions.
[2024-10-13 09:56:30,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 200 transitions, 540 flow
[2024-10-13 09:56:30,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 200 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-10-13 09:56:30,055 INFO L231 Difference]: Finished difference. Result has 203 places, 0 transitions, 0 flow
[2024-10-13 09:56:30,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=203, PETRI_TRANSITIONS=0}
[2024-10-13 09:56:30,056 INFO L277 CegarLoopForPetriNet]: 236 programPoint places, -33 predicate places.
[2024-10-13 09:56:30,056 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 0 transitions, 0 flow
[2024-10-13 09:56:30,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-13 09:56:30,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (58 of 59 remaining)
[2024-10-13 09:56:30,060 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (57 of 59 remaining)
[2024-10-13 09:56:30,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (56 of 59 remaining)
[2024-10-13 09:56:30,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (55 of 59 remaining)
[2024-10-13 09:56:30,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (54 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 59 remaining)
[2024-10-13 09:56:30,063 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 59 remaining)
[2024-10-13 09:56:30,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 59 remaining)
[2024-10-13 09:56:30,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 59 remaining)
[2024-10-13 09:56:30,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (44 of 59 remaining)
[2024-10-13 09:56:30,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 59 remaining)
[2024-10-13 09:56:30,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 59 remaining)
[2024-10-13 09:56:30,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (29 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 59 remaining)
[2024-10-13 09:56:30,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (23 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (22 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (21 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (20 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (19 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (18 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (17 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (16 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 59 remaining)
[2024-10-13 09:56:30,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (9 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (8 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (7 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (5 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (4 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (3 of 59 remaining)
[2024-10-13 09:56:30,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 59 remaining)
[2024-10-13 09:56:30,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (1 of 59 remaining)
[2024-10-13 09:56:30,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (0 of 59 remaining)
[2024-10-13 09:56:30,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-13 09:56:30,070 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 09:56:30,083 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-13 09:56:30,084 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-13 09:56:30,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:56:30 BasicIcfg
[2024-10-13 09:56:30,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-13 09:56:30,093 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-13 09:56:30,093 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-13 09:56:30,093 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-13 09:56:30,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:56:25" (3/4) ...
[2024-10-13 09:56:30,095 INFO L139 WitnessPrinter]: Generating witness for correct program
[2024-10-13 09:56:30,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1
[2024-10-13 09:56:30,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2
[2024-10-13 09:56:30,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3
[2024-10-13 09:56:30,099 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4
[2024-10-13 09:56:30,104 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges
[2024-10-13 09:56:30,105 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-10-13 09:56:30,105 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-10-13 09:56:30,105 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-10-13 09:56:30,191 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-10-13 09:56:30,192 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-10-13 09:56:30,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-13 09:56:30,192 INFO L158 Benchmark]: Toolchain (without parser) took 5822.50ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 105.7MB in the beginning and 95.0MB in the end (delta: 10.8MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,193 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-13 09:56:30,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.25ms. Allocated memory is still 184.5MB. Free memory was 105.5MB in the beginning and 148.7MB in the end (delta: -43.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 184.5MB. Free memory was 148.7MB in the beginning and 147.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,193 INFO L158 Benchmark]: Boogie Preprocessor took 32.56ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 145.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,194 INFO L158 Benchmark]: RCFGBuilder took 595.02ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,194 INFO L158 Benchmark]: TraceAbstraction took 4722.87ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 139.2MB in the beginning and 101.3MB in the end (delta: 38.0MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,194 INFO L158 Benchmark]: Witness Printer took 98.77ms. Allocated memory is still 274.7MB. Free memory was 101.3MB in the beginning and 95.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-10-13 09:56:30,196 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.19ms. Allocated memory is still 184.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 333.25ms. Allocated memory is still 184.5MB. Free memory was 105.5MB in the beginning and 148.7MB in the end (delta: -43.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 33.72ms. Allocated memory is still 184.5MB. Free memory was 148.7MB in the beginning and 147.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 32.56ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 145.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 595.02ms. Allocated memory is still 184.5MB. Free memory was 145.5MB in the beginning and 139.2MB in the end (delta: 6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 4722.87ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 139.2MB in the beginning and 101.3MB in the end (delta: 38.0MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB.
* Witness Printer took 98.77ms. Allocated memory is still 274.7MB. Free memory was 101.3MB in the beginning and 95.0MB 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: 38]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 38]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 39]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 39]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 39]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 46]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 46]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 47]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 47]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 47]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 54]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 54]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 55]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 55]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 55]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 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: 75]: 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: 77]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 80]: 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: 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: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 62]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 63]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 63]: there are no data races
For all program executions holds that there are no data races at this location
- PositiveResult [Line: 63]: 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 9 procedures, 342 locations, 59 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 681 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 697 IncrementalHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 103 mSDtfsCounter, 697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=497occurred in iteration=12, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 955 NumberOfCodeBlocks, 955 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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
35 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2024-10-13 09:56:30,233 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