./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-counter-outer-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-counter-outer-race-2.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/thread-join-counter-outer-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:24:13,923 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-29 15:24:13,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-10-29 15:24:13,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-29 15:24:13,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-29 15:24:14,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-29 15:24:14,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-29 15:24:14,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-29 15:24:14,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-29 15:24:14,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-29 15:24:14,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-29 15:24:14,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-29 15:24:14,032 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-29 15:24:14,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-29 15:24:14,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-29 15:24:14,035 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-29 15:24:14,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-29 15:24:14,036 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-29 15:24:14,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-29 15:24:14,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-29 15:24:14,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-29 15:24:14,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-29 15:24:14,038 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-10-29 15:24:14,038 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-29 15:24:14,038 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-29 15:24:14,039 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-29 15:24:14,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-29 15:24:14,039 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-29 15:24:14,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-29 15:24:14,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-29 15:24:14,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-29 15:24:14,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:24:14,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-29 15:24:14,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-29 15:24:14,041 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-29 15:24:14,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-29 15:24:14,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-29 15:24:14,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-29 15:24:14,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-29 15:24:14,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-29 15:24:14,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-29 15:24:14,054 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:24:14,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-29 15:24:14,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-29 15:24:14,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-29 15:24:14,326 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-29 15:24:14,326 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-29 15:24:14,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i
[2024-10-29 15:24:15,827 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-29 15:24:16,073 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-29 15:24:16,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-2.i
[2024-10-29 15:24:16,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b042a5bb5/4360e3120a774adda6731e1c255c3e80/FLAG56e11d36d
[2024-10-29 15:24:16,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b042a5bb5/4360e3120a774adda6731e1c255c3e80
[2024-10-29 15:24:16,109 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-10-29 15:24:16,111 INFO L274 PluginConnector]: Witness Parser initialized
[2024-10-29 15:24:16,112 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-counter-outer-race-2.yml/witness.graphml
[2024-10-29 15:24:16,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-29 15:24:16,185 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-10-29 15:24:16,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-29 15:24:16,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-29 15:24:16,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-29 15:24:16,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:16" (1/2) ...
[2024-10-29 15:24:16,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55608d58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:16, skipping insertion in model container
[2024-10-29 15:24:16,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:24:16" (1/2) ...
[2024-10-29 15:24:16,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@275fcfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:24:16, skipping insertion in model container
[2024-10-29 15:24:16,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:16" (2/2) ...
[2024-10-29 15:24:16,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55608d58 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:16, skipping insertion in model container
[2024-10-29 15:24:16,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:16" (2/2) ...
[2024-10-29 15:24:16,238 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-29 15:24:16,620 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:24:16,652 INFO L200 MainTranslator]: Completed pre-run
[2024-10-29 15:24:16,693 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:24:16,742 INFO L204 MainTranslator]: Completed translation
[2024-10-29 15:24:16,743 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:24:16 WrapperNode
[2024-10-29 15:24:16,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-29 15:24:16,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-29 15:24:16,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-29 15:24:16,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-29 15:24:16,754 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:16" (1/1) ...
[2024-10-29 15:24:16,770 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:16" (1/1) ...
[2024-10-29 15:24:16,805 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198
[2024-10-29 15:24:16,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-29 15:24:16,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-29 15:24:16,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-29 15:24:16,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-29 15:24:16,818 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:16" (1/1) ...
[2024-10-29 15:24:16,818 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:16" (1/1) ...
[2024-10-29 15:24:16,822 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:16" (1/1) ...
[2024-10-29 15:24:16,827 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:16" (1/1) ...
[2024-10-29 15:24:16,844 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:16" (1/1) ...
[2024-10-29 15:24:16,852 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:16" (1/1) ...
[2024-10-29 15:24:16,857 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:16" (1/1) ...
[2024-10-29 15:24:16,859 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:16" (1/1) ...
[2024-10-29 15:24:16,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-29 15:24:16,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-29 15:24:16,871 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-29 15:24:16,871 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-29 15:24:16,872 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:16" (1/1) ...
[2024-10-29 15:24:16,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:24:16,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-29 15:24:16,911 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:16,919 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:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-10-29 15:24:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-29 15:24:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-29 15:24:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure thread
[2024-10-29 15:24:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure thread
[2024-10-29 15:24:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-10-29 15:24:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-29 15:24:16,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-29 15:24:16,970 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:17,142 INFO L238 CfgBuilder]: Building ICFG
[2024-10-29 15:24:17,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-29 15:24:17,460 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-29 15:24:17,461 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-29 15:24:17,508 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-29 15:24:17,508 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-10-29 15:24:17,509 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:24:17 BoogieIcfgContainer
[2024-10-29 15:24:17,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-29 15:24:17,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-29 15:24:17,512 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-29 15:24:17,516 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-29 15:24:17,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:24:16" (1/4) ...
[2024-10-29 15:24:17,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5127f014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:24:17, skipping insertion in model container
[2024-10-29 15:24:17,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:24:16" (2/4) ...
[2024-10-29 15:24:17,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5127f014 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:17, skipping insertion in model container
[2024-10-29 15:24:17,517 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:16" (3/4) ...
[2024-10-29 15:24:17,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5127f014 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:24:17, skipping insertion in model container
[2024-10-29 15:24:17,518 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:17" (4/4) ...
[2024-10-29 15:24:17,519 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-2.i
[2024-10-29 15:24:17,519 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton
[2024-10-29 15:24:17,544 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-29 15:24:17,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-10-29 15:24:17,546 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-29 15:24:17,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-29 15:24:17,621 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:17,635 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 233 places, 234 transitions, 472 flow
[2024-10-29 15:24:17,802 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 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,834 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:24:17,845 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;@1c5af13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:24:17,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-10-29 15:24:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 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,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-10-29 15:24:17,865 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:17,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:17,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -548724940, now seen corresponding path program 1 times
[2024-10-29 15:24:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:17,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678876586]
[2024-10-29 15:24:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:18,380 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:18,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:18,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678876586]
[2024-10-29 15:24:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678876586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:18,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:18,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406484293]
[2024-10-29 15:24:18,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:18,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:18,425 INFO L87 Difference]: Start difference. First operand has 1718 states, 1691 states have (on average 1.9337670017740982) internal successors, (3270), 1717 states have internal predecessors, (3270), 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 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:18,616 INFO L93 Difference]: Finished difference Result 3702 states and 7329 transitions.
[2024-10-29 15:24:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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 154
[2024-10-29 15:24:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:18,657 INFO L225 Difference]: With dead ends: 3702
[2024-10-29 15:24:18,657 INFO L226 Difference]: Without dead ends: 2130
[2024-10-29 15:24:18,670 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:18,674 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 72 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:18,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 464 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states.
[2024-10-29 15:24:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1716.
[2024-10-29 15:24:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1695 states have (on average 1.8867256637168142) internal successors, (3198), 1715 states have internal predecessors, (3198), 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:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 3198 transitions.
[2024-10-29 15:24:18,812 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 3198 transitions. Word has length 154
[2024-10-29 15:24:18,813 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 3198 transitions.
[2024-10-29 15:24:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 3198 transitions.
[2024-10-29 15:24:18,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-10-29 15:24:18,816 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:18,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-29 15:24:18,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1331078444, now seen corresponding path program 1 times
[2024-10-29 15:24:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010328611]
[2024-10-29 15:24:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:19,007 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:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010328611]
[2024-10-29 15:24:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010328611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122866158]
[2024-10-29 15:24:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:19,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:19,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:19,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:19,015 INFO L87 Difference]: Start difference. First operand 1716 states and 3198 transitions. Second operand has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:19,107 INFO L93 Difference]: Finished difference Result 1823 states and 3407 transitions.
[2024-10-29 15:24:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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 159
[2024-10-29 15:24:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:19,121 INFO L225 Difference]: With dead ends: 1823
[2024-10-29 15:24:19,122 INFO L226 Difference]: Without dead ends: 1789
[2024-10-29 15:24:19,122 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:19,124 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 31 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 440 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:19,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 440 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:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states.
[2024-10-29 15:24:19,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1735.
[2024-10-29 15:24:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1716 states have (on average 1.8857808857808858) internal successors, (3236), 1734 states have internal predecessors, (3236), 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:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 3236 transitions.
[2024-10-29 15:24:19,209 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 3236 transitions. Word has length 159
[2024-10-29 15:24:19,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:19,215 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 3236 transitions.
[2024-10-29 15:24:19,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 3236 transitions.
[2024-10-29 15:24:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-10-29 15:24:19,217 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:19,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-29 15:24:19,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:19,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1295908703, now seen corresponding path program 1 times
[2024-10-29 15:24:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:19,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014069441]
[2024-10-29 15:24:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:19,419 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:19,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:19,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014069441]
[2024-10-29 15:24:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014069441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742335679]
[2024-10-29 15:24:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:19,428 INFO L87 Difference]: Start difference. First operand 1735 states and 3236 transitions. Second operand has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:19,479 INFO L93 Difference]: Finished difference Result 1763 states and 3276 transitions.
[2024-10-29 15:24:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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 160
[2024-10-29 15:24:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:19,491 INFO L225 Difference]: With dead ends: 1763
[2024-10-29 15:24:19,492 INFO L226 Difference]: Without dead ends: 1635
[2024-10-29 15:24:19,493 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:19,494 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 34 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 455 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:19,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 455 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:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states.
[2024-10-29 15:24:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1625.
[2024-10-29 15:24:19,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1625 states, 1608 states have (on average 1.8694029850746268) internal successors, (3006), 1624 states have internal predecessors, (3006), 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:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 3006 transitions.
[2024-10-29 15:24:19,538 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 3006 transitions. Word has length 160
[2024-10-29 15:24:19,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 1625 states and 3006 transitions.
[2024-10-29 15:24:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 3006 transitions.
[2024-10-29 15:24:19,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-10-29 15:24:19,547 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:19,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-29 15:24:19,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1173892455, now seen corresponding path program 1 times
[2024-10-29 15:24:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102052232]
[2024-10-29 15:24:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:19,675 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:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:19,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102052232]
[2024-10-29 15:24:19,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102052232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:19,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:19,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:19,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239846879]
[2024-10-29 15:24:19,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:19,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:19,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:19,679 INFO L87 Difference]: Start difference. First operand 1625 states and 3006 transitions. Second operand has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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:19,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:19,751 INFO L93 Difference]: Finished difference Result 1742 states and 3233 transitions.
[2024-10-29 15:24:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:19,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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 178
[2024-10-29 15:24:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:19,763 INFO L225 Difference]: With dead ends: 1742
[2024-10-29 15:24:19,763 INFO L226 Difference]: Without dead ends: 1691
[2024-10-29 15:24:19,765 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:19,765 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 47 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:19,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 454 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states.
[2024-10-29 15:24:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1631.
[2024-10-29 15:24:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1617 states have (on average 1.8651824366110081) internal successors, (3016), 1630 states have internal predecessors, (3016), 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:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3016 transitions.
[2024-10-29 15:24:19,819 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3016 transitions. Word has length 178
[2024-10-29 15:24:19,819 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:19,819 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 3016 transitions.
[2024-10-29 15:24:19,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3016 transitions.
[2024-10-29 15:24:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191
[2024-10-29 15:24:19,823 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:19,823 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-29 15:24:19,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:19,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875370, now seen corresponding path program 1 times
[2024-10-29 15:24:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207979683]
[2024-10-29 15:24:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:19,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:24:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:20,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207979683]
[2024-10-29 15:24:20,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207979683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-29 15:24:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672269119]
[2024-10-29 15:24:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:20,088 INFO L87 Difference]: Start difference. First operand 1631 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:20,137 INFO L93 Difference]: Finished difference Result 2325 states and 4312 transitions.
[2024-10-29 15:24:20,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:20,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 190
[2024-10-29 15:24:20,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:20,146 INFO L225 Difference]: With dead ends: 2325
[2024-10-29 15:24:20,147 INFO L226 Difference]: Without dead ends: 1274
[2024-10-29 15:24:20,149 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:20,151 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 48 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:20,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 446 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:24:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states.
[2024-10-29 15:24:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1230.
[2024-10-29 15:24:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1225 states have (on average 1.7714285714285714) internal successors, (2170), 1229 states have internal predecessors, (2170), 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:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2170 transitions.
[2024-10-29 15:24:20,181 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2170 transitions. Word has length 190
[2024-10-29 15:24:20,182 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:20,182 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 2170 transitions.
[2024-10-29 15:24:20,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:20,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2170 transitions.
[2024-10-29 15:24:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191
[2024-10-29 15:24:20,184 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:20,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-29 15:24:20,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:20,186 INFO L85 PathProgramCache]: Analyzing trace with hash 388988448, now seen corresponding path program 1 times
[2024-10-29 15:24:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515371307]
[2024-10-29 15:24:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:20,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:20,269 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:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515371307]
[2024-10-29 15:24:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515371307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655147533]
[2024-10-29 15:24:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:20,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:20,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:20,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:20,277 INFO L87 Difference]: Start difference. First operand 1230 states and 2170 transitions. Second operand has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:20,328 INFO L93 Difference]: Finished difference Result 1241 states and 2184 transitions.
[2024-10-29 15:24:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:20,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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 190
[2024-10-29 15:24:20,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:20,336 INFO L225 Difference]: With dead ends: 1241
[2024-10-29 15:24:20,336 INFO L226 Difference]: Without dead ends: 1084
[2024-10-29 15:24:20,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:20,338 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 47 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:20,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 455 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:24:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states.
[2024-10-29 15:24:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084.
[2024-10-29 15:24:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1081 states have (on average 1.7354301572617947) internal successors, (1876), 1083 states have internal predecessors, (1876), 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:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1876 transitions.
[2024-10-29 15:24:20,366 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1876 transitions. Word has length 190
[2024-10-29 15:24:20,367 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:20,369 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1876 transitions.
[2024-10-29 15:24:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1876 transitions.
[2024-10-29 15:24:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2024-10-29 15:24:20,371 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:20,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-29 15:24:20,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-10-29 15:24:20,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1428460310, now seen corresponding path program 1 times
[2024-10-29 15:24:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:20,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407260290]
[2024-10-29 15:24:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:20,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:24:20,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:24:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:24:20,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:24:20,500 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:24:20,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-10-29 15:24:20,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-10-29 15:24:20,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-10-29 15:24:20,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-10-29 15:24:20,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-10-29 15:24:20,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-10-29 15:24:20,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-10-29 15:24:20,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-10-29 15:24:20,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-10-29 15:24:20,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-10-29 15:24:20,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-10-29 15:24:20,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-29 15:24:20,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:24:20,510 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-10-29 15:24:20,510 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-10-29 15:24:20,538 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-29 15:24:20,541 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:20,544 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 267 places, 266 transitions, 542 flow
[2024-10-29 15:24:22,629 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51617 states, 51499 states have (on average 2.9504262218683857) internal successors, (151944), 51616 states have internal predecessors, (151944), 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:22,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:24:22,632 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;@1c5af13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:24:22,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2024-10-29 15:24:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 51617 states, 51499 states have (on average 2.9504262218683857) internal successors, (151944), 51616 states have internal predecessors, (151944), 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:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2024-10-29 15:24:22,837 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:22,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:22,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1521434764, now seen corresponding path program 1 times
[2024-10-29 15:24:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537950519]
[2024-10-29 15:24:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:22,934 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:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537950519]
[2024-10-29 15:24:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537950519] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327118985]
[2024-10-29 15:24:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:23,052 INFO L87 Difference]: Start difference. First operand has 51617 states, 51499 states have (on average 2.9504262218683857) internal successors, (151944), 51616 states have internal predecessors, (151944), 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 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:25,455 INFO L93 Difference]: Finished difference Result 128800 states and 383529 transitions.
[2024-10-29 15:24:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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 154
[2024-10-29 15:24:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:26,412 INFO L225 Difference]: With dead ends: 128800
[2024-10-29 15:24:26,412 INFO L226 Difference]: Without dead ends: 77329
[2024-10-29 15:24:26,552 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:26,554 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:26,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 530 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77329 states.
[2024-10-29 15:24:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77329 to 55272.
[2024-10-29 15:24:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55272 states, 55164 states have (on average 2.9022369661373357) internal successors, (160099), 55271 states have internal predecessors, (160099), 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:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55272 states to 55272 states and 160099 transitions.
[2024-10-29 15:24:29,414 INFO L78 Accepts]: Start accepts. Automaton has 55272 states and 160099 transitions. Word has length 154
[2024-10-29 15:24:29,415 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:29,415 INFO L471 AbstractCegarLoop]: Abstraction has 55272 states and 160099 transitions.
[2024-10-29 15:24:29,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 77.0) internal successors, (154), 3 states have internal predecessors, (154), 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:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 55272 states and 160099 transitions.
[2024-10-29 15:24:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2024-10-29 15:24:29,417 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:29,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-29 15:24:29,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:29,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash 137137014, now seen corresponding path program 1 times
[2024-10-29 15:24:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356016559]
[2024-10-29 15:24:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:29,487 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:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356016559]
[2024-10-29 15:24:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356016559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104802411]
[2024-10-29 15:24:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:29,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:29,492 INFO L87 Difference]: Start difference. First operand 55272 states and 160099 transitions. Second operand has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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:30,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:30,405 INFO L93 Difference]: Finished difference Result 59496 states and 172304 transitions.
[2024-10-29 15:24:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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 159
[2024-10-29 15:24:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:30,871 INFO L225 Difference]: With dead ends: 59496
[2024-10-29 15:24:30,871 INFO L226 Difference]: Without dead ends: 58375
[2024-10-29 15:24:30,913 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:30,914 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 60 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:30,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 511 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58375 states.
[2024-10-29 15:24:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58375 to 56235.
[2024-10-29 15:24:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56235 states, 56130 states have (on average 2.901995367895956) internal successors, (162889), 56234 states have internal predecessors, (162889), 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:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56235 states to 56235 states and 162889 transitions.
[2024-10-29 15:24:33,278 INFO L78 Accepts]: Start accepts. Automaton has 56235 states and 162889 transitions. Word has length 159
[2024-10-29 15:24:33,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:33,278 INFO L471 AbstractCegarLoop]: Abstraction has 56235 states and 162889 transitions.
[2024-10-29 15:24:33,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 79.5) internal successors, (159), 3 states have internal predecessors, (159), 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:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 56235 states and 162889 transitions.
[2024-10-29 15:24:33,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2024-10-29 15:24:33,280 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:33,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-29 15:24:33,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:33,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:33,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1356536993, now seen corresponding path program 1 times
[2024-10-29 15:24:33,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595143526]
[2024-10-29 15:24:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:33,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:33,352 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:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595143526]
[2024-10-29 15:24:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595143526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196728253]
[2024-10-29 15:24:33,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:33,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:33,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:33,357 INFO L87 Difference]: Start difference. First operand 56235 states and 162889 transitions. Second operand has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:33,710 INFO L93 Difference]: Finished difference Result 59609 states and 171992 transitions.
[2024-10-29 15:24:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:33,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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 160
[2024-10-29 15:24:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:34,006 INFO L225 Difference]: With dead ends: 59609
[2024-10-29 15:24:34,006 INFO L226 Difference]: Without dead ends: 57835
[2024-10-29 15:24:34,045 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:34,046 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 65 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:34,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 532 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57835 states.
[2024-10-29 15:24:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57835 to 55505.
[2024-10-29 15:24:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55505 states, 55405 states have (on average 2.898565111452035) internal successors, (160595), 55504 states have internal predecessors, (160595), 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:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55505 states to 55505 states and 160595 transitions.
[2024-10-29 15:24:36,121 INFO L78 Accepts]: Start accepts. Automaton has 55505 states and 160595 transitions. Word has length 160
[2024-10-29 15:24:36,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:36,122 INFO L471 AbstractCegarLoop]: Abstraction has 55505 states and 160595 transitions.
[2024-10-29 15:24:36,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 80.0) internal successors, (160), 3 states have internal predecessors, (160), 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:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 55505 states and 160595 transitions.
[2024-10-29 15:24:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179
[2024-10-29 15:24:36,124 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:36,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-29 15:24:36,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:36,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:36,125 INFO L85 PathProgramCache]: Analyzing trace with hash 491341624, now seen corresponding path program 1 times
[2024-10-29 15:24:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035724679]
[2024-10-29 15:24:36,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:36,208 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:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035724679]
[2024-10-29 15:24:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035724679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:36,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15249853]
[2024-10-29 15:24:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:36,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:36,211 INFO L87 Difference]: Start difference. First operand 55505 states and 160595 transitions. Second operand has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:36,621 INFO L93 Difference]: Finished difference Result 61921 states and 179281 transitions.
[2024-10-29 15:24:36,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:36,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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 178
[2024-10-29 15:24:36,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:36,920 INFO L225 Difference]: With dead ends: 61921
[2024-10-29 15:24:36,921 INFO L226 Difference]: Without dead ends: 60175
[2024-10-29 15:24:36,951 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:36,952 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 78 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:36,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 525 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60175 states.
[2024-10-29 15:24:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60175 to 56907.
[2024-10-29 15:24:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56907 states, 56813 states have (on average 2.898825972928731) internal successors, (164691), 56906 states have internal predecessors, (164691), 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,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56907 states to 56907 states and 164691 transitions.
[2024-10-29 15:24:39,234 INFO L78 Accepts]: Start accepts. Automaton has 56907 states and 164691 transitions. Word has length 178
[2024-10-29 15:24:39,235 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:39,235 INFO L471 AbstractCegarLoop]: Abstraction has 56907 states and 164691 transitions.
[2024-10-29 15:24:39,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 89.0) internal successors, (178), 3 states have internal predecessors, (178), 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,235 INFO L276 IsEmpty]: Start isEmpty. Operand 56907 states and 164691 transitions.
[2024-10-29 15:24:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191
[2024-10-29 15:24:39,237 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:39,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-29 15:24:39,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:39,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1998787519, now seen corresponding path program 1 times
[2024-10-29 15:24:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:39,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206360845]
[2024-10-29 15:24:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:39,305 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:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:39,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206360845]
[2024-10-29 15:24:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206360845] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:39,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28935059]
[2024-10-29 15:24:39,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:39,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:39,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:39,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:39,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:39,307 INFO L87 Difference]: Start difference. First operand 56907 states and 164691 transitions. Second operand has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:39,636 INFO L93 Difference]: Finished difference Result 59131 states and 170850 transitions.
[2024-10-29 15:24:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:39,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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 190
[2024-10-29 15:24:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:39,874 INFO L225 Difference]: With dead ends: 59131
[2024-10-29 15:24:39,875 INFO L226 Difference]: Without dead ends: 56455
[2024-10-29 15:24:39,904 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:39,905 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 81 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:39,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 545 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56455 states.
[2024-10-29 15:24:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56455 to 55451.
[2024-10-29 15:24:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55451 states, 55371 states have (on average 2.89097180834733) internal successors, (160076), 55450 states have internal predecessors, (160076), 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:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55451 states to 55451 states and 160076 transitions.
[2024-10-29 15:24:41,465 INFO L78 Accepts]: Start accepts. Automaton has 55451 states and 160076 transitions. Word has length 190
[2024-10-29 15:24:41,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:41,465 INFO L471 AbstractCegarLoop]: Abstraction has 55451 states and 160076 transitions.
[2024-10-29 15:24:41,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 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:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 55451 states and 160076 transitions.
[2024-10-29 15:24:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191
[2024-10-29 15:24:41,467 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:41,467 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-29 15:24:41,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -61833407, now seen corresponding path program 1 times
[2024-10-29 15:24:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437040145]
[2024-10-29 15:24:41,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:41,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:24:42,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:42,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437040145]
[2024-10-29 15:24:42,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437040145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:42,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:42,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-29 15:24:42,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755498541]
[2024-10-29 15:24:42,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:42,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:42,134 INFO L87 Difference]: Start difference. First operand 55451 states and 160076 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:42,673 INFO L93 Difference]: Finished difference Result 90390 states and 258862 transitions.
[2024-10-29 15:24:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 190
[2024-10-29 15:24:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:42,932 INFO L225 Difference]: With dead ends: 90390
[2024-10-29 15:24:42,933 INFO L226 Difference]: Without dead ends: 36371
[2024-10-29 15:24:43,037 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:43,038 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 82 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:43,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 541 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:24:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36371 states.
[2024-10-29 15:24:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36371 to 33115.
[2024-10-29 15:24:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33115 states, 33077 states have (on average 2.755812195785591) internal successors, (91154), 33114 states have internal predecessors, (91154), 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:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33115 states to 33115 states and 91154 transitions.
[2024-10-29 15:24:44,411 INFO L78 Accepts]: Start accepts. Automaton has 33115 states and 91154 transitions. Word has length 190
[2024-10-29 15:24:44,412 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 33115 states and 91154 transitions.
[2024-10-29 15:24:44,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 33115 states and 91154 transitions.
[2024-10-29 15:24:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206
[2024-10-29 15:24:44,415 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:44,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-29 15:24:44,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:44,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:44,416 INFO L85 PathProgramCache]: Analyzing trace with hash 630969115, now seen corresponding path program 1 times
[2024-10-29 15:24:44,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:44,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217431075]
[2024-10-29 15:24:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:44,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:24:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2024-10-29 15:24:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:24:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217431075]
[2024-10-29 15:24:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217431075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:24:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:24:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:24:44,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104157286]
[2024-10-29 15:24:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:24:44,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:24:44,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:24:44,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:24:44,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:24:44,497 INFO L87 Difference]: Start difference. First operand 33115 states and 91154 transitions. Second operand has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 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:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:24:44,711 INFO L93 Difference]: Finished difference Result 33583 states and 92413 transitions.
[2024-10-29 15:24:44,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:24:44,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 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 205
[2024-10-29 15:24:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:24:44,861 INFO L225 Difference]: With dead ends: 33583
[2024-10-29 15:24:44,861 INFO L226 Difference]: Without dead ends: 32908
[2024-10-29 15:24:44,875 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:44,876 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 65 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:24:44,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 518 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:24:44,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32908 states.
[2024-10-29 15:24:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32908 to 32668.
[2024-10-29 15:24:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32668 states, 32643 states have (on average 2.7542811628833133) internal successors, (89908), 32667 states have internal predecessors, (89908), 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:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32668 states to 32668 states and 89908 transitions.
[2024-10-29 15:24:45,491 INFO L78 Accepts]: Start accepts. Automaton has 32668 states and 89908 transitions. Word has length 205
[2024-10-29 15:24:45,492 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:24:45,492 INFO L471 AbstractCegarLoop]: Abstraction has 32668 states and 89908 transitions.
[2024-10-29 15:24:45,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 93.5) internal successors, (187), 3 states have internal predecessors, (187), 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:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 32668 states and 89908 transitions.
[2024-10-29 15:24:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2024-10-29 15:24:45,494 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:24:45,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-29 15:24:45,495 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-10-29 15:24:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:24:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2112461981, now seen corresponding path program 1 times
[2024-10-29 15:24:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:24:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737720680]
[2024-10-29 15:24:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:24:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:24:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:24:45,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:24:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:24:46,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:24:46,094 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:24:46,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining)
[2024-10-29 15:24:46,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining)
[2024-10-29 15:24:46,094 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining)
[2024-10-29 15:24:46,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining)
[2024-10-29 15:24:46,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining)
[2024-10-29 15:24:46,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining)
[2024-10-29 15:24:46,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining)
[2024-10-29 15:24:46,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining)
[2024-10-29 15:24:46,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-29 15:24:46,096 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:24:46,224 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-10-29 15:24:46,228 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
[2024-10-29 15:24:46,230 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back.
[2024-10-29 15:24:46,239 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances
[2024-10-29 15:24:46,241 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-29 15:24:46,245 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:24:46 BasicIcfg
[2024-10-29 15:24:46,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-29 15:24:46,246 INFO L158 Benchmark]: Toolchain (without parser) took 30061.24ms. Allocated memory was 184.5MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 122.7MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,246 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:24:46,246 INFO L158 Benchmark]: Witness Parser took 1.14ms. Allocated memory is still 184.5MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:24:46,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.60ms. Allocated memory is still 184.5MB. Free memory was 122.3MB in the beginning and 99.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.51ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 96.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,248 INFO L158 Benchmark]: Boogie Preprocessor took 59.20ms. Allocated memory is still 184.5MB. Free memory was 96.7MB in the beginning and 94.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,248 INFO L158 Benchmark]: RCFGBuilder took 641.89ms. Allocated memory is still 184.5MB. Free memory was 94.2MB in the beginning and 71.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,249 INFO L158 Benchmark]: TraceAbstraction took 28733.56ms. Allocated memory was 184.5MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 70.3MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
[2024-10-29 15:24:46,250 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 16.1GB.
* Witness Parser took 1.14ms. Allocated memory is still 184.5MB. Free memory is still 124.8MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 557.60ms. Allocated memory is still 184.5MB. Free memory was 122.3MB in the beginning and 99.6MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 62.51ms. Allocated memory is still 184.5MB. Free memory was 99.6MB in the beginning and 96.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 59.20ms. Allocated memory is still 184.5MB. Free memory was 96.7MB in the beginning and 94.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 641.89ms. Allocated memory is still 184.5MB. Free memory was 94.2MB in the beginning and 71.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 28733.56ms. Allocated memory was 184.5MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 70.3MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- DataRaceFoundResult [Line: 696]: Data race detected
Data race detected
The following path leads to a data race:
[L685] 0 int threads_alive = 0;
VAL [threads_alive=0]
[L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
VAL [threads_alive=0, threads_alive_mutex={1:0}]
[L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } };
VAL [threads_alive=0, threads_alive_mutex={1:0}]
[L688] 0 int data = 0;
VAL [data=0, threads_alive=0, threads_alive_mutex={1:0}]
[L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}]
[L701] 0 int threads_total = __VERIFIER_nondet_int();
VAL [data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L702] CALL 0 assume_abort_if_not(threads_total >= 0)
[L682] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}]
[L702] RET 0 assume_abort_if_not(threads_total >= 0)
[L703] 0 int i = 0;
VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L703] COND TRUE 0 i < threads_total
VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L705] 0 threads_alive++
VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1]
[L707] 0 pthread_t tid;
VAL [data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1]
[L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0))
VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=1, threads_alive_mutex={1:0}, threads_total=1, tid=-1]
[L692] 1 threads_alive--
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}]
[L696] 1 data = __VERIFIER_nondet_int()
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}]
[L703] 0 i++
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L703] COND FALSE 0 !(i < threads_total)
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L712] COND FALSE 0 !(\read(threads_alive))
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L715] 0 return data;
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1]
[L696] 1 data = __VERIFIER_nondet_int()
VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}]
Now there is a data race on ~data~0 between
C: return data; [715]
and
C: data = __VERIFIER_nondet_int() [696]
- UnprovableResult [Line: 705]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 712]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 715]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 705]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- UnprovableResult [Line: 692]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 692]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 3 procedures, 263 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 2714 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1218 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 1496 mSDtfsCounter, 247 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1735occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 582 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1025 ConstructedInterpolants, 0 QuantifiedInterpolants, 1137 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
CFG has 4 procedures, 295 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 25.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 532 mSDsluCounter, 3702 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1605 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 2097 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56907occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 34295 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1444 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-10-29 15:24:46,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE