./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-array-dynamic-race-2.yml/witness.graphml --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 194c01fd Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-array-dynamic-race-2.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.5-dev-194c01f-m [2024-10-29 15:23:57,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:23:57,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:23:57,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:23:57,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:23:57,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:23:57,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:23:57,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:23:57,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:23:57,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:23:57,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:23:57,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:23:57,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:23:57,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:23:57,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:23:57,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:23:57,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:23:57,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:23:57,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:23:57,246 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:23:57,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:23:57,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:23:57,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:23:57,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:23:57,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:23:57,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:23:57,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:23:57,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:23:57,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:23:57,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:23:57,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:23:57,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:23:57,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:23:57,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:23:57,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:23:57,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:23:57,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:23:57,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:23:57,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:23:57,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:23:57,255 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:23:57,256 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:23:57,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:23:57,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:23:57,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:23:57,507 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:23:57,507 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:23:57,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-10-29 15:23:58,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:23:59,170 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:23:59,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-10-29 15:23:59,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db37277c4/0bcca54a8469499a90b2a34ff938bada/FLAGddcc23e4f [2024-10-29 15:23:59,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db37277c4/0bcca54a8469499a90b2a34ff938bada [2024-10-29 15:23:59,222 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:23:59,223 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:23:59,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-array-dynamic-race-2.yml/witness.graphml [2024-10-29 15:23:59,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:23:59,298 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:23:59,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:23:59,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:23:59,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:23:59,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:59" (1/2) ... [2024-10-29 15:23:59,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d54a936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:59, skipping insertion in model container [2024-10-29 15:23:59,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:59" (1/2) ... [2024-10-29 15:23:59,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40f77e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:59, skipping insertion in model container [2024-10-29 15:23:59,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:59" (2/2) ... [2024-10-29 15:23:59,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d54a936 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:59, skipping insertion in model container [2024-10-29 15:23:59,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:59" (2/2) ... [2024-10-29 15:23:59,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:23:59,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:23:59,845 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:23:59,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:24:00,026 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:24:00,027 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00 WrapperNode [2024-10-29 15:24:00,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:24:00,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:00,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:24:00,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:24:00,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,106 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-10-29 15:24:00,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:24:00,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:24:00,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:24:00,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:24:00,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:24:00,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:24:00,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:24:00,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:24:00,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (1/1) ... [2024-10-29 15:24:00,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:24:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:24:00,188 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-29 15:24:00,200 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-29 15:24:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-29 15:24:00,246 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-29 15:24:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:24:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:24:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-29 15:24:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-29 15:24:00,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:24:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:24:00,248 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-29 15:24:00,248 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-29 15:24:00,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:24:00,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:24:00,252 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 15:24:00,390 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:24:00,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:24:00,624 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:24:00,624 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:24:00,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:24:00,654 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-29 15:24:00,655 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:00 BoogieIcfgContainer [2024-10-29 15:24:00,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:24:00,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:24:00,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:24:00,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:24:00,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:23:59" (1/4) ... [2024-10-29 15:24:00,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb2e3ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:24:00, skipping insertion in model container [2024-10-29 15:24:00,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:59" (2/4) ... [2024-10-29 15:24:00,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb2e3ec and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:00, skipping insertion in model container [2024-10-29 15:24:00,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:00" (3/4) ... [2024-10-29 15:24:00,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb2e3ec and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:00, skipping insertion in model container [2024-10-29 15:24:00,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:00" (4/4) ... [2024-10-29 15:24:00,668 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2024-10-29 15:24:00,668 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:24:00,692 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:24:00,692 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-29 15:24:00,692 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:24:00,762 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 15:24:00,780 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:00,795 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 89 transitions, 185 flow [2024-10-29 15:24:00,885 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 737 states, 722 states have (on average 1.9362880886426592) internal successors, (1398), 736 states have internal predecessors, (1398), 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-29 15:24:00,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:00,922 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=None, 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;@3137dd3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:00,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-29 15:24:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 737 states, 722 states have (on average 1.9362880886426592) internal successors, (1398), 736 states have internal predecessors, (1398), 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-29 15:24:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:00,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:00,934 INFO L215 NwaCegarLoop]: 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] [2024-10-29 15:24:00,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:00,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1930866065, now seen corresponding path program 1 times [2024-10-29 15:24:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307994483] [2024-10-29 15:24:00,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:00,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:01,173 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-29 15:24:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307994483] [2024-10-29 15:24:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307994483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:01,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:01,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:01,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678803876] [2024-10-29 15:24:01,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:01,219 INFO L87 Difference]: Start difference. First operand has 737 states, 722 states have (on average 1.9362880886426592) internal successors, (1398), 736 states have internal predecessors, (1398), 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) Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:01,309 INFO L93 Difference]: Finished difference Result 1498 states and 2868 transitions. [2024-10-29 15:24:01,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:01,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 34 [2024-10-29 15:24:01,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:01,330 INFO L225 Difference]: With dead ends: 1498 [2024-10-29 15:24:01,331 INFO L226 Difference]: Without dead ends: 678 [2024-10-29 15:24:01,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:01,341 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:01,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 169 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-10-29 15:24:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 668. [2024-10-29 15:24:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 656 states have (on average 1.8628048780487805) internal successors, (1222), 667 states have internal predecessors, (1222), 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-29 15:24:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1222 transitions. [2024-10-29 15:24:01,442 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1222 transitions. Word has length 34 [2024-10-29 15:24:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:01,442 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1222 transitions. [2024-10-29 15:24:01,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1222 transitions. [2024-10-29 15:24:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:24:01,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:01,444 INFO L215 NwaCegarLoop]: 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-29 15:24:01,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:24:01,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash 894653936, now seen corresponding path program 1 times [2024-10-29 15:24:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:01,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009927324] [2024-10-29 15:24:01,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:01,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:02,137 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-29 15:24:02,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009927324] [2024-10-29 15:24:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009927324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:02,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:02,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:02,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146783909] [2024-10-29 15:24:02,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:02,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:02,146 INFO L87 Difference]: Start difference. First operand 668 states and 1222 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-29 15:24:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:02,241 INFO L93 Difference]: Finished difference Result 668 states and 1222 transitions. [2024-10-29 15:24:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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) Word has length 36 [2024-10-29 15:24:02,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:02,248 INFO L225 Difference]: With dead ends: 668 [2024-10-29 15:24:02,248 INFO L226 Difference]: Without dead ends: 650 [2024-10-29 15:24:02,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:02,250 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:02,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 185 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2024-10-29 15:24:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2024-10-29 15:24:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 641 states have (on average 1.8533541341653665) internal successors, (1188), 649 states have internal predecessors, (1188), 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-29 15:24:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1188 transitions. [2024-10-29 15:24:02,280 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1188 transitions. Word has length 36 [2024-10-29 15:24:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:02,281 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 1188 transitions. [2024-10-29 15:24:02,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-29 15:24:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1188 transitions. [2024-10-29 15:24:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:24:02,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:02,283 INFO L215 NwaCegarLoop]: 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-29 15:24:02,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:24:02,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:02,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2009182366, now seen corresponding path program 1 times [2024-10-29 15:24:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044523607] [2024-10-29 15:24:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:02,382 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-29 15:24:02,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:02,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044523607] [2024-10-29 15:24:02,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044523607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:02,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:02,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429612072] [2024-10-29 15:24:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:02,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:24:02,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:24:02,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:24:02,385 INFO L87 Difference]: Start difference. First operand 650 states and 1188 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-29 15:24:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:02,490 INFO L93 Difference]: Finished difference Result 658 states and 1195 transitions. [2024-10-29 15:24:02,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:02,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) Word has length 36 [2024-10-29 15:24:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:02,495 INFO L225 Difference]: With dead ends: 658 [2024-10-29 15:24:02,496 INFO L226 Difference]: Without dead ends: 648 [2024-10-29 15:24:02,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:02,499 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 32 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:02,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 252 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2024-10-29 15:24:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2024-10-29 15:24:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 639 states have (on average 1.8544600938967135) internal successors, (1185), 647 states have internal predecessors, (1185), 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-29 15:24:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1185 transitions. [2024-10-29 15:24:02,519 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1185 transitions. Word has length 36 [2024-10-29 15:24:02,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:02,519 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1185 transitions. [2024-10-29 15:24:02,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-29 15:24:02,520 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1185 transitions. [2024-10-29 15:24:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-29 15:24:02,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:02,522 INFO L215 NwaCegarLoop]: 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] [2024-10-29 15:24:02,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:24:02,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:02,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -667923900, now seen corresponding path program 1 times [2024-10-29 15:24:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:02,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827481055] [2024-10-29 15:24:02,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:02,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:02,590 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-29 15:24:02,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:02,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827481055] [2024-10-29 15:24:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827481055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:02,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043471339] [2024-10-29 15:24:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:02,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:02,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:02,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:02,592 INFO L87 Difference]: Start difference. First operand 648 states and 1185 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-29 15:24:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:02,614 INFO L93 Difference]: Finished difference Result 659 states and 1199 transitions. [2024-10-29 15:24:02,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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) Word has length 46 [2024-10-29 15:24:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:02,619 INFO L225 Difference]: With dead ends: 659 [2024-10-29 15:24:02,619 INFO L226 Difference]: Without dead ends: 574 [2024-10-29 15:24:02,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:02,624 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:02,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 185 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-29 15:24:02,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-10-29 15:24:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 569 states have (on average 1.820738137082601) internal successors, (1036), 573 states have internal predecessors, (1036), 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-29 15:24:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1036 transitions. [2024-10-29 15:24:02,643 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1036 transitions. Word has length 46 [2024-10-29 15:24:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:02,645 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 1036 transitions. [2024-10-29 15:24:02,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-29 15:24:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1036 transitions. [2024-10-29 15:24:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:24:02,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:02,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:02,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:24:02,648 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:02,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1285259620, now seen corresponding path program 1 times [2024-10-29 15:24:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:02,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597802686] [2024-10-29 15:24:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:24:03,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597802686] [2024-10-29 15:24:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597802686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:03,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:03,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878396028] [2024-10-29 15:24:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:03,028 INFO L87 Difference]: Start difference. First operand 574 states and 1036 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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-29 15:24:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:03,120 INFO L93 Difference]: Finished difference Result 574 states and 1036 transitions. [2024-10-29 15:24:03,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:03,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2024-10-29 15:24:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:03,125 INFO L225 Difference]: With dead ends: 574 [2024-10-29 15:24:03,125 INFO L226 Difference]: Without dead ends: 415 [2024-10-29 15:24:03,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:03,127 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 66 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:03,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 349 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-29 15:24:03,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2024-10-29 15:24:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 412 states have (on average 1.7864077669902914) internal successors, (736), 414 states have internal predecessors, (736), 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-29 15:24:03,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 736 transitions. [2024-10-29 15:24:03,140 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 736 transitions. Word has length 53 [2024-10-29 15:24:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 736 transitions. [2024-10-29 15:24:03,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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-29 15:24:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 736 transitions. [2024-10-29 15:24:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-29 15:24:03,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:03,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 15:24:03,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:24:03,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-10-29 15:24:03,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:03,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1012954957, now seen corresponding path program 1 times [2024-10-29 15:24:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:03,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687719891] [2024-10-29 15:24:03,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:03,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:24:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:03,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:24:03,228 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:24:03,229 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-29 15:24:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-10-29 15:24:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-10-29 15:24:03,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-10-29 15:24:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-10-29 15:24:03,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-10-29 15:24:03,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:24:03,240 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-29 15:24:03,242 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:24:03,242 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-29 15:24:03,263 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-29 15:24:03,264 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:03,266 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 107 transitions, 230 flow [2024-10-29 15:24:03,662 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12671 states, 12630 states have (on average 2.8333333333333335) internal successors, (35785), 12670 states have internal predecessors, (35785), 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-29 15:24:03,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:03,665 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=None, 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;@3137dd3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:03,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-29 15:24:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 12671 states, 12630 states have (on average 2.8333333333333335) internal successors, (35785), 12670 states have internal predecessors, (35785), 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-29 15:24:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:03,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:03,720 INFO L215 NwaCegarLoop]: 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] [2024-10-29 15:24:03,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:03,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1073777201, now seen corresponding path program 1 times [2024-10-29 15:24:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894117123] [2024-10-29 15:24:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:03,749 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-29 15:24:03,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:03,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894117123] [2024-10-29 15:24:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894117123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201559846] [2024-10-29 15:24:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:03,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:03,776 INFO L87 Difference]: Start difference. First operand has 12671 states, 12630 states have (on average 2.8333333333333335) internal successors, (35785), 12670 states have internal predecessors, (35785), 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) Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:04,143 INFO L93 Difference]: Finished difference Result 26698 states and 75454 transitions. [2024-10-29 15:24:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 34 [2024-10-29 15:24:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:04,365 INFO L225 Difference]: With dead ends: 26698 [2024-10-29 15:24:04,365 INFO L226 Difference]: Without dead ends: 13160 [2024-10-29 15:24:04,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:04,392 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 35 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:04,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 206 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:04,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13160 states. [2024-10-29 15:24:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13160 to 12260. [2024-10-29 15:24:04,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12260 states, 12224 states have (on average 2.778059554973822) internal successors, (33959), 12259 states have internal predecessors, (33959), 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-29 15:24:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12260 states to 12260 states and 33959 transitions. [2024-10-29 15:24:05,000 INFO L78 Accepts]: Start accepts. Automaton has 12260 states and 33959 transitions. Word has length 34 [2024-10-29 15:24:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:05,000 INFO L471 AbstractCegarLoop]: Abstraction has 12260 states and 33959 transitions. [2024-10-29 15:24:05,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:05,001 INFO L276 IsEmpty]: Start isEmpty. Operand 12260 states and 33959 transitions. [2024-10-29 15:24:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:24:05,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:05,001 INFO L215 NwaCegarLoop]: 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-29 15:24:05,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:24:05,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:05,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:05,003 INFO L85 PathProgramCache]: Analyzing trace with hash -76665168, now seen corresponding path program 1 times [2024-10-29 15:24:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:05,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274667043] [2024-10-29 15:24:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:05,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:05,231 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-29 15:24:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274667043] [2024-10-29 15:24:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274667043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:05,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:05,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807042741] [2024-10-29 15:24:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:05,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:05,234 INFO L87 Difference]: Start difference. First operand 12260 states and 33959 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-29 15:24:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:05,426 INFO L93 Difference]: Finished difference Result 12260 states and 33959 transitions. [2024-10-29 15:24:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:05,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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) Word has length 36 [2024-10-29 15:24:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:05,509 INFO L225 Difference]: With dead ends: 12260 [2024-10-29 15:24:05,510 INFO L226 Difference]: Without dead ends: 11953 [2024-10-29 15:24:05,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:05,520 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:05,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 297 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:05,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11953 states. [2024-10-29 15:24:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11953 to 11953. [2024-10-29 15:24:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11953 states, 11924 states have (on average 2.775243206977524) internal successors, (33092), 11952 states have internal predecessors, (33092), 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-29 15:24:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11953 states to 11953 states and 33092 transitions. [2024-10-29 15:24:05,954 INFO L78 Accepts]: Start accepts. Automaton has 11953 states and 33092 transitions. Word has length 36 [2024-10-29 15:24:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:05,955 INFO L471 AbstractCegarLoop]: Abstraction has 11953 states and 33092 transitions. [2024-10-29 15:24:05,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-29 15:24:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11953 states and 33092 transitions. [2024-10-29 15:24:05,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:24:05,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:05,956 INFO L215 NwaCegarLoop]: 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-29 15:24:05,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:24:05,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:05,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1314465826, now seen corresponding path program 1 times [2024-10-29 15:24:05,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:05,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129959975] [2024-10-29 15:24:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:05,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:06,200 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-29 15:24:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129959975] [2024-10-29 15:24:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129959975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:06,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:06,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072393913] [2024-10-29 15:24:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:06,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:24:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:24:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:24:06,206 INFO L87 Difference]: Start difference. First operand 11953 states and 33092 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-29 15:24:06,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:06,368 INFO L93 Difference]: Finished difference Result 11961 states and 33099 transitions. [2024-10-29 15:24:06,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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) Word has length 36 [2024-10-29 15:24:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:06,454 INFO L225 Difference]: With dead ends: 11961 [2024-10-29 15:24:06,454 INFO L226 Difference]: Without dead ends: 11951 [2024-10-29 15:24:06,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:06,463 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:06,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 311 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11951 states. [2024-10-29 15:24:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11951 to 11951. [2024-10-29 15:24:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11951 states, 11922 states have (on average 2.775457138064083) internal successors, (33089), 11950 states have internal predecessors, (33089), 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-29 15:24:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11951 states to 11951 states and 33089 transitions. [2024-10-29 15:24:06,879 INFO L78 Accepts]: Start accepts. Automaton has 11951 states and 33089 transitions. Word has length 36 [2024-10-29 15:24:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:06,879 INFO L471 AbstractCegarLoop]: Abstraction has 11951 states and 33089 transitions. [2024-10-29 15:24:06,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-29 15:24:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 11951 states and 33089 transitions. [2024-10-29 15:24:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-29 15:24:06,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:06,881 INFO L215 NwaCegarLoop]: 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] [2024-10-29 15:24:06,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:24:06,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:06,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2079582252, now seen corresponding path program 1 times [2024-10-29 15:24:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165839632] [2024-10-29 15:24:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:06,917 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-29 15:24:06,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165839632] [2024-10-29 15:24:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165839632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:06,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:06,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935079608] [2024-10-29 15:24:06,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:06,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:06,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:06,921 INFO L87 Difference]: Start difference. First operand 11951 states and 33089 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-29 15:24:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:07,123 INFO L93 Difference]: Finished difference Result 13501 states and 37355 transitions. [2024-10-29 15:24:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:07,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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) Word has length 46 [2024-10-29 15:24:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:07,189 INFO L225 Difference]: With dead ends: 13501 [2024-10-29 15:24:07,189 INFO L226 Difference]: Without dead ends: 12420 [2024-10-29 15:24:07,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:07,198 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 58 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:07,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 225 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2024-10-29 15:24:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 11708. [2024-10-29 15:24:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11708 states, 11680 states have (on average 2.7628424657534247) internal successors, (32270), 11707 states have internal predecessors, (32270), 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-29 15:24:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11708 states to 11708 states and 32270 transitions. [2024-10-29 15:24:07,503 INFO L78 Accepts]: Start accepts. Automaton has 11708 states and 32270 transitions. Word has length 46 [2024-10-29 15:24:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:07,504 INFO L471 AbstractCegarLoop]: Abstraction has 11708 states and 32270 transitions. [2024-10-29 15:24:07,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 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-29 15:24:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 11708 states and 32270 transitions. [2024-10-29 15:24:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:24:07,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:07,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:24:07,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1021294111, now seen corresponding path program 1 times [2024-10-29 15:24:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894517867] [2024-10-29 15:24:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:24:07,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894517867] [2024-10-29 15:24:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894517867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:07,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:07,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140204188] [2024-10-29 15:24:07,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:07,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:07,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:07,821 INFO L87 Difference]: Start difference. First operand 11708 states and 32270 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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-29 15:24:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:08,116 INFO L93 Difference]: Finished difference Result 11708 states and 32270 transitions. [2024-10-29 15:24:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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) Word has length 53 [2024-10-29 15:24:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:08,173 INFO L225 Difference]: With dead ends: 11708 [2024-10-29 15:24:08,174 INFO L226 Difference]: Without dead ends: 10666 [2024-10-29 15:24:08,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:08,185 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 132 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:08,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 553 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:24:08,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10666 states. [2024-10-29 15:24:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10666 to 10666. [2024-10-29 15:24:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10666 states, 10647 states have (on average 2.7587113740959897) internal successors, (29372), 10665 states have internal predecessors, (29372), 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-29 15:24:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10666 states to 10666 states and 29372 transitions. [2024-10-29 15:24:08,553 INFO L78 Accepts]: Start accepts. Automaton has 10666 states and 29372 transitions. Word has length 53 [2024-10-29 15:24:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:08,554 INFO L471 AbstractCegarLoop]: Abstraction has 10666 states and 29372 transitions. [2024-10-29 15:24:08,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 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-29 15:24:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10666 states and 29372 transitions. [2024-10-29 15:24:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-29 15:24:08,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:08,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:08,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:24:08,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:08,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1285856888, now seen corresponding path program 1 times [2024-10-29 15:24:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10296829] [2024-10-29 15:24:08,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:08,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10296829] [2024-10-29 15:24:08,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10296829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:24:08,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332056512] [2024-10-29 15:24:08,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:08,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:24:08,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:24:08,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:24:08,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-29 15:24:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:08,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-29 15:24:08,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:24:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:08,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-29 15:24:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332056512] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-29 15:24:09,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-29 15:24:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-29 15:24:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083693592] [2024-10-29 15:24:09,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-29 15:24:09,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-29 15:24:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-29 15:24:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-29 15:24:09,016 INFO L87 Difference]: Start difference. First operand 10666 states and 29372 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-29 15:24:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:09,237 INFO L93 Difference]: Finished difference Result 10738 states and 29486 transitions. [2024-10-29 15:24:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-29 15:24:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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) Word has length 59 [2024-10-29 15:24:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:09,292 INFO L225 Difference]: With dead ends: 10738 [2024-10-29 15:24:09,292 INFO L226 Difference]: Without dead ends: 8263 [2024-10-29 15:24:09,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-29 15:24:09,306 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 222 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:09,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 547 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2024-10-29 15:24:09,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 8263. [2024-10-29 15:24:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8263 states, 8251 states have (on average 2.751181674948491) internal successors, (22700), 8262 states have internal predecessors, (22700), 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-29 15:24:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8263 states to 8263 states and 22700 transitions. [2024-10-29 15:24:09,591 INFO L78 Accepts]: Start accepts. Automaton has 8263 states and 22700 transitions. Word has length 59 [2024-10-29 15:24:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:09,592 INFO L471 AbstractCegarLoop]: Abstraction has 8263 states and 22700 transitions. [2024-10-29 15:24:09,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-29 15:24:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8263 states and 22700 transitions. [2024-10-29 15:24:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:24:09,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:09,594 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 15:24:09,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-29 15:24:09,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-29 15:24:09,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:09,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1060604224, now seen corresponding path program 1 times [2024-10-29 15:24:09,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:09,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260539725] [2024-10-29 15:24:09,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:09,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 15:24:09,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260539725] [2024-10-29 15:24:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260539725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:09,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:09,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:09,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739139769] [2024-10-29 15:24:09,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:09,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:09,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:09,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:09,845 INFO L87 Difference]: Start difference. First operand 8263 states and 22700 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-29 15:24:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:09,918 INFO L93 Difference]: Finished difference Result 9028 states and 24698 transitions. [2024-10-29 15:24:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:09,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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) Word has length 63 [2024-10-29 15:24:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:09,968 INFO L225 Difference]: With dead ends: 9028 [2024-10-29 15:24:09,968 INFO L226 Difference]: Without dead ends: 8395 [2024-10-29 15:24:09,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:09,977 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 56 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:09,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 222 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2024-10-29 15:24:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 8087. [2024-10-29 15:24:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8087 states, 8078 states have (on average 2.7436246595692) internal successors, (22163), 8086 states have internal predecessors, (22163), 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-29 15:24:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8087 states to 8087 states and 22163 transitions. [2024-10-29 15:24:10,202 INFO L78 Accepts]: Start accepts. Automaton has 8087 states and 22163 transitions. Word has length 63 [2024-10-29 15:24:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:10,203 INFO L471 AbstractCegarLoop]: Abstraction has 8087 states and 22163 transitions. [2024-10-29 15:24:10,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-29 15:24:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8087 states and 22163 transitions. [2024-10-29 15:24:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-29 15:24:10,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:10,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 15:24:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:24:10,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:10,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:10,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1923282876, now seen corresponding path program 1 times [2024-10-29 15:24:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884547770] [2024-10-29 15:24:10,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:10,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:24:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884547770] [2024-10-29 15:24:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884547770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:24:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883766503] [2024-10-29 15:24:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:10,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:10,329 INFO L87 Difference]: Start difference. First operand 8087 states and 22163 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-29 15:24:10,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:10,393 INFO L93 Difference]: Finished difference Result 10527 states and 28465 transitions. [2024-10-29 15:24:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:10,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) Word has length 71 [2024-10-29 15:24:10,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:10,424 INFO L225 Difference]: With dead ends: 10527 [2024-10-29 15:24:10,427 INFO L226 Difference]: Without dead ends: 4457 [2024-10-29 15:24:10,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:10,443 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 55 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:10,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 196 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:24:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2024-10-29 15:24:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4457. [2024-10-29 15:24:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 4452 states have (on average 2.522461814914645) internal successors, (11230), 4456 states have internal predecessors, (11230), 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-29 15:24:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 11230 transitions. [2024-10-29 15:24:10,545 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 11230 transitions. Word has length 71 [2024-10-29 15:24:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:10,546 INFO L471 AbstractCegarLoop]: Abstraction has 4457 states and 11230 transitions. [2024-10-29 15:24:10,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-29 15:24:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 11230 transitions. [2024-10-29 15:24:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-29 15:24:10,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:10,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-29 15:24:10,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:24:10,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-10-29 15:24:10,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:10,553 INFO L85 PathProgramCache]: Analyzing trace with hash -881547959, now seen corresponding path program 1 times [2024-10-29 15:24:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:10,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766085273] [2024-10-29 15:24:10,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:10,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:24:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:24:10,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:24:10,601 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:24:10,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-29 15:24:10,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-10-29 15:24:10,601 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-10-29 15:24:10,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-10-29 15:24:10,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-10-29 15:24:10,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-10-29 15:24:10,602 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-10-29 15:24:10,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:24:10,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:24:10,603 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:24:10,603 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-29 15:24:10,624 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-29 15:24:10,625 WARN L158 CegarLoopFactory]: Violation witness validation is only supported for CEGAR loops based on FINITE_AUTOMATA. Ignoring concurrency settiong PETRI_NET and switching to FINITE_AUTOMATA. [2024-10-29 15:24:10,628 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 125 transitions, 277 flow [2024-10-29 15:24:16,775 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 221975 states, 221864 states have (on average 3.7402868423899327) internal successors, (829835), 221974 states have internal predecessors, (829835), 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-29 15:24:16,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:24:16,777 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=None, 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;@3137dd3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:24:16,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-29 15:24:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 221975 states, 221864 states have (on average 3.7402868423899327) internal successors, (829835), 221974 states have internal predecessors, (829835), 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-29 15:24:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-29 15:24:17,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:17,154 INFO L215 NwaCegarLoop]: 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] [2024-10-29 15:24:17,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-29 15:24:17,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1758380177, now seen corresponding path program 1 times [2024-10-29 15:24:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80669011] [2024-10-29 15:24:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:17,177 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-29 15:24:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80669011] [2024-10-29 15:24:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80669011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:24:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459630001] [2024-10-29 15:24:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:17,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:24:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:24:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:17,563 INFO L87 Difference]: Start difference. First operand has 221975 states, 221864 states have (on average 3.7402868423899327) internal successors, (829835), 221974 states have internal predecessors, (829835), 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) Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:24,652 INFO L93 Difference]: Finished difference Result 473818 states and 1769970 transitions. [2024-10-29 15:24:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:24:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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) Word has length 34 [2024-10-29 15:24:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:24:28,089 INFO L225 Difference]: With dead ends: 473818 [2024-10-29 15:24:28,089 INFO L226 Difference]: Without dead ends: 244704 [2024-10-29 15:24:28,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:24:28,488 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 50 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:24:28,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 243 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:24:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244704 states. [2024-10-29 15:24:36,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244704 to 221744. [2024-10-29 15:24:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221744 states, 221642 states have (on average 3.6888676333907835) internal successors, (817608), 221743 states have internal predecessors, (817608), 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-29 15:24:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221744 states to 221744 states and 817608 transitions. [2024-10-29 15:24:40,824 INFO L78 Accepts]: Start accepts. Automaton has 221744 states and 817608 transitions. Word has length 34 [2024-10-29 15:24:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:24:40,824 INFO L471 AbstractCegarLoop]: Abstraction has 221744 states and 817608 transitions. [2024-10-29 15:24:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 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-29 15:24:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 221744 states and 817608 transitions. [2024-10-29 15:24:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-29 15:24:40,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:24:40,825 INFO L215 NwaCegarLoop]: 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-29 15:24:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-29 15:24:40,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-29 15:24:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:24:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash -850124816, now seen corresponding path program 1 times [2024-10-29 15:24:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:24:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155967336] [2024-10-29 15:24:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:24:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:24:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:24:40,996 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-29 15:24:40,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:24:40,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155967336] [2024-10-29 15:24:40,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155967336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:24:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:24:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:24:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799923786] [2024-10-29 15:24:40,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:24:40,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:24:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:24:40,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:24:40,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:24:40,998 INFO L87 Difference]: Start difference. First operand 221744 states and 817608 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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-29 15:24:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:24:43,560 INFO L93 Difference]: Finished difference Result 221744 states and 817608 transitions. [2024-10-29 15:24:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:24:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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) Word has length 36 [2024-10-29 15:24:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted.