./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-index-bitmask-race.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/per-thread-index-bitmask-race.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-index-bitmask-race.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-194c01f-m
[2024-10-29 15:23:20,651 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-29 15:23:20,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-10-29 15:23:20,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-29 15:23:20,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-29 15:23:20,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-29 15:23:20,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-29 15:23:20,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-29 15:23:20,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-29 15:23:20,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-29 15:23:20,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-29 15:23:20,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-29 15:23:20,740 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-29 15:23:20,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-29 15:23:20,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-29 15:23:20,741 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-29 15:23:20,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-29 15:23:20,742 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-29 15:23:20,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-29 15:23:20,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-29 15:23:20,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-29 15:23:20,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-29 15:23:20,745 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-10-29 15:23:20,745 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-29 15:23:20,745 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-29 15:23:20,745 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-29 15:23:20,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-29 15:23:20,746 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-29 15:23:20,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-29 15:23:20,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-29 15:23:20,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-29 15:23:20,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:23:20,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-29 15:23:20,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-29 15:23:20,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-29 15:23:20,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-29 15:23:20,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None
[2024-10-29 15:23:20,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-29 15:23:20,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-29 15:23:20,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-29 15:23:20,957 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-10-29 15:23:20,958 INFO L274 PluginConnector]: Witness Parser initialized
[2024-10-29 15:23:20,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-index-bitmask-race.yml/witness.graphml
[2024-10-29 15:23:21,070 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-29 15:23:21,070 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-29 15:23:21,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i
[2024-10-29 15:23:22,416 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-29 15:23:22,791 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-29 15:23:22,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i
[2024-10-29 15:23:22,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78199582f/8c4c3fbe6a06470abda47a6a21487424/FLAGc3557b9dc
[2024-10-29 15:23:23,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78199582f/8c4c3fbe6a06470abda47a6a21487424
[2024-10-29 15:23:23,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-29 15:23:23,016 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-10-29 15:23:23,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-29 15:23:23,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-29 15:23:23,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-29 15:23:23,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:21" (1/2) ...
[2024-10-29 15:23:23,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2711da65 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:23, skipping insertion in model container
[2024-10-29 15:23:23,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:21" (1/2) ...
[2024-10-29 15:23:23,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@521bc0f4 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:23, skipping insertion in model container
[2024-10-29 15:23:23,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:23" (2/2) ...
[2024-10-29 15:23:23,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2711da65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23, skipping insertion in model container
[2024-10-29 15:23:23,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:23" (2/2) ...
[2024-10-29 15:23:23,063 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-29 15:23:23,400 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:23:23,411 INFO L200 MainTranslator]: Completed pre-run
[2024-10-29 15:23:23,446 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:23:23,492 INFO L204 MainTranslator]: Completed translation
[2024-10-29 15:23:23,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23 WrapperNode
[2024-10-29 15:23:23,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-29 15:23:23,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-29 15:23:23,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-29 15:23:23,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-29 15:23:23,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,544 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-10-29 15:23:23,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-29 15:23:23,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-29 15:23:23,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-29 15:23:23,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-29 15:23:23,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-29 15:23:23,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-29 15:23:23,589 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-29 15:23:23,589 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-29 15:23:23,590 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (1/1) ...
[2024-10-29 15:23:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:23:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-29 15:23:23,621 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:23:23,623 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:23:23,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-10-29 15:23:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2024-10-29 15:23:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-10-29 15:23:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-10-29 15:23:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure thread
[2024-10-29 15:23:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure thread
[2024-10-29 15:23:23,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-29 15:23:23,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-29 15:23:23,668 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:23:23,792 INFO L238 CfgBuilder]: Building ICFG
[2024-10-29 15:23:23,797 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-29 15:23:24,080 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-29 15:23:24,081 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-29 15:23:24,105 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-29 15:23:24,105 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-10-29 15:23:24,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:24 BoogieIcfgContainer
[2024-10-29 15:23:24,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-29 15:23:24,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-29 15:23:24,109 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-29 15:23:24,112 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-29 15:23:24,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:21" (1/4) ...
[2024-10-29 15:23:24,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7923f2f0 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:23:24, skipping insertion in model container
[2024-10-29 15:23:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:23:23" (2/4) ...
[2024-10-29 15:23:24,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7923f2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:24, skipping insertion in model container
[2024-10-29 15:23:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:23" (3/4) ...
[2024-10-29 15:23:24,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7923f2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:24, skipping insertion in model container
[2024-10-29 15:23:24,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:24" (4/4) ...
[2024-10-29 15:23:24,117 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-10-29 15:23:24,117 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton
[2024-10-29 15:23:24,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-29 15:23:24,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2024-10-29 15:23:24,135 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-29 15:23:24,204 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-10-29 15:23:24,224 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:23:24,239 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 172 places, 187 transitions, 381 flow
[2024-10-29 15:23:24,352 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3666 states, 3614 states have (on average 2.16961815163254) internal successors, (7841), 3665 states have internal predecessors, (7841), 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:23:24,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:23:24,383 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;@790e2f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:23:24,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2024-10-29 15:23:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 3666 states, 3614 states have (on average 2.16961815163254) internal successors, (7841), 3665 states have internal predecessors, (7841), 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:23:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-10-29 15:23:24,432 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:24,433 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]
[2024-10-29 15:23:24,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1429972780, now seen corresponding path program 1 times
[2024-10-29 15:23:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:24,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375177589]
[2024-10-29 15:23:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:24,690 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:23:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375177589]
[2024-10-29 15:23:24,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375177589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:24,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:24,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621134625]
[2024-10-29 15:23:24,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:24,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:24,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:24,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:24,725 INFO L87 Difference]: Start difference. First operand has 3666 states, 3614 states have (on average 2.16961815163254) internal successors, (7841), 3665 states have internal predecessors, (7841), 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 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:23:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:24,828 INFO L93 Difference]: Finished difference Result 7316 states and 15666 transitions.
[2024-10-29 15:23:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:24,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30
[2024-10-29 15:23:24,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:24,858 INFO L225 Difference]: With dead ends: 7316
[2024-10-29 15:23:24,858 INFO L226 Difference]: Without dead ends: 3626
[2024-10-29 15:23:24,868 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:23:24,872 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:24,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states.
[2024-10-29 15:23:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3626.
[2024-10-29 15:23:25,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3577 states have (on average 2.1478892927033826) internal successors, (7683), 3625 states have internal predecessors, (7683), 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:23:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 7683 transitions.
[2024-10-29 15:23:25,046 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 7683 transitions. Word has length 30
[2024-10-29 15:23:25,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:25,047 INFO L471 AbstractCegarLoop]: Abstraction has 3626 states and 7683 transitions.
[2024-10-29 15:23:25,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:23:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 7683 transitions.
[2024-10-29 15:23:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-10-29 15:23:25,048 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:25,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:25,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-29 15:23:25,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:25,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -493487120, now seen corresponding path program 1 times
[2024-10-29 15:23:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675095987]
[2024-10-29 15:23:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:25,107 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:23:25,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675095987]
[2024-10-29 15:23:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675095987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:25,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950535148]
[2024-10-29 15:23:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:25,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:25,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:25,163 INFO L87 Difference]: Start difference. First operand 3626 states and 7683 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:25,272 INFO L93 Difference]: Finished difference Result 4191 states and 8888 transitions.
[2024-10-29 15:23:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36
[2024-10-29 15:23:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:25,293 INFO L225 Difference]: With dead ends: 4191
[2024-10-29 15:23:25,293 INFO L226 Difference]: Without dead ends: 4022
[2024-10-29 15:23:25,295 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:23:25,296 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 133 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:25,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 392 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:25,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states.
[2024-10-29 15:23:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3523.
[2024-10-29 15:23:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3523 states, 3486 states have (on average 2.1399885255306943) internal successors, (7460), 3522 states have internal predecessors, (7460), 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:23:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 7460 transitions.
[2024-10-29 15:23:25,397 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 7460 transitions. Word has length 36
[2024-10-29 15:23:25,398 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:25,398 INFO L471 AbstractCegarLoop]: Abstraction has 3523 states and 7460 transitions.
[2024-10-29 15:23:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 7460 transitions.
[2024-10-29 15:23:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-10-29 15:23:25,401 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:25,401 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]
[2024-10-29 15:23:25,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-29 15:23:25,401 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 11869524, now seen corresponding path program 1 times
[2024-10-29 15:23:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:25,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441898803]
[2024-10-29 15:23:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:25,461 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:23:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441898803]
[2024-10-29 15:23:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441898803] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:25,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984151090]
[2024-10-29 15:23:25,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:25,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:25,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:25,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:25,463 INFO L87 Difference]: Start difference. First operand 3523 states and 7460 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:23:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:25,511 INFO L93 Difference]: Finished difference Result 3534 states and 7471 transitions.
[2024-10-29 15:23:25,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 41
[2024-10-29 15:23:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:25,535 INFO L225 Difference]: With dead ends: 3534
[2024-10-29 15:23:25,535 INFO L226 Difference]: Without dead ends: 3376
[2024-10-29 15:23:25,537 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:23:25,538 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 142 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:25,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 374 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states.
[2024-10-29 15:23:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3368.
[2024-10-29 15:23:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 3342 states have (on average 2.1376421304608018) internal successors, (7144), 3367 states have internal predecessors, (7144), 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:23:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 7144 transitions.
[2024-10-29 15:23:25,676 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 7144 transitions. Word has length 41
[2024-10-29 15:23:25,676 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 7144 transitions.
[2024-10-29 15:23:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:23:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 7144 transitions.
[2024-10-29 15:23:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2024-10-29 15:23:25,678 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:25,678 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]
[2024-10-29 15:23:25,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-29 15:23:25,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:25,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash 793688972, now seen corresponding path program 1 times
[2024-10-29 15:23:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:25,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886376721]
[2024-10-29 15:23:25,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:25,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:25,795 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:23:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886376721]
[2024-10-29 15:23:25,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886376721] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:25,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:25,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:25,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893601815]
[2024-10-29 15:23:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-29 15:23:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-29 15:23:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-29 15:23:25,797 INFO L87 Difference]: Start difference. First operand 3368 states and 7144 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:23:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:25,889 INFO L93 Difference]: Finished difference Result 3376 states and 7151 transitions.
[2024-10-29 15:23:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:25,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43
[2024-10-29 15:23:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:25,910 INFO L225 Difference]: With dead ends: 3376
[2024-10-29 15:23:25,910 INFO L226 Difference]: Without dead ends: 3366
[2024-10-29 15:23:25,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:25,915 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 114 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:25,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 460 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3366 states.
[2024-10-29 15:23:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3366 to 3366.
[2024-10-29 15:23:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 3340 states have (on average 2.1380239520958084) internal successors, (7141), 3365 states have internal predecessors, (7141), 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:23:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 7141 transitions.
[2024-10-29 15:23:26,059 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 7141 transitions. Word has length 43
[2024-10-29 15:23:26,059 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:26,059 INFO L471 AbstractCegarLoop]: Abstraction has 3366 states and 7141 transitions.
[2024-10-29 15:23:26,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:23:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 7141 transitions.
[2024-10-29 15:23:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55
[2024-10-29 15:23:26,061 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:26,061 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]
[2024-10-29 15:23:26,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-29 15:23:26,061 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:26,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2140868580, now seen corresponding path program 1 times
[2024-10-29 15:23:26,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79077616]
[2024-10-29 15:23:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:26,116 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:23:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79077616]
[2024-10-29 15:23:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79077616] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-29 15:23:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948887936]
[2024-10-29 15:23:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:26,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:26,119 INFO L87 Difference]: Start difference. First operand 3366 states and 7141 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:23:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:26,211 INFO L93 Difference]: Finished difference Result 6675 states and 14218 transitions.
[2024-10-29 15:23:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54
[2024-10-29 15:23:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:26,234 INFO L225 Difference]: With dead ends: 6675
[2024-10-29 15:23:26,234 INFO L226 Difference]: Without dead ends: 3365
[2024-10-29 15:23:26,244 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:23:26,245 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:26,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 269 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:26,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states.
[2024-10-29 15:23:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3365.
[2024-10-29 15:23:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3365 states, 3339 states have (on average 2.138065289008685) internal successors, (7139), 3364 states have internal predecessors, (7139), 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:23:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 7139 transitions.
[2024-10-29 15:23:26,341 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 7139 transitions. Word has length 54
[2024-10-29 15:23:26,342 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:26,342 INFO L471 AbstractCegarLoop]: Abstraction has 3365 states and 7139 transitions.
[2024-10-29 15:23:26,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:23:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 7139 transitions.
[2024-10-29 15:23:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65
[2024-10-29 15:23:26,343 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:26,343 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]
[2024-10-29 15:23:26,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-29 15:23:26,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1107175753, now seen corresponding path program 1 times
[2024-10-29 15:23:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:26,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918570055]
[2024-10-29 15:23:26,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:26,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:26,403 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:23:26,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:26,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918570055]
[2024-10-29 15:23:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918570055] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:26,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94052432]
[2024-10-29 15:23:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:26,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:26,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:26,409 INFO L87 Difference]: Start difference. First operand 3365 states and 7139 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:23:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:26,537 INFO L93 Difference]: Finished difference Result 7640 states and 16310 transitions.
[2024-10-29 15:23:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64
[2024-10-29 15:23:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:26,574 INFO L225 Difference]: With dead ends: 7640
[2024-10-29 15:23:26,574 INFO L226 Difference]: Without dead ends: 4320
[2024-10-29 15:23:26,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:26,583 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 234 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:26,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 516 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states.
[2024-10-29 15:23:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 3398.
[2024-10-29 15:23:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3372 states have (on average 2.1287069988137604) internal successors, (7178), 3397 states have internal predecessors, (7178), 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:23:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 7178 transitions.
[2024-10-29 15:23:26,659 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 7178 transitions. Word has length 64
[2024-10-29 15:23:26,659 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:26,659 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 7178 transitions.
[2024-10-29 15:23:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:23:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 7178 transitions.
[2024-10-29 15:23:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-29 15:23:26,663 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:26,663 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]
[2024-10-29 15:23:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-29 15:23:26,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:26,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:26,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1247648174, now seen corresponding path program 1 times
[2024-10-29 15:23:26,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:26,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763094303]
[2024-10-29 15:23:26,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:26,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:26,819 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:23:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763094303]
[2024-10-29 15:23:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763094303] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:26,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:26,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060468495]
[2024-10-29 15:23:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:26,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:26,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:26,824 INFO L87 Difference]: Start difference. First operand 3398 states and 7178 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:27,051 INFO L93 Difference]: Finished difference Result 7423 states and 15782 transitions.
[2024-10-29 15:23:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65
[2024-10-29 15:23:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:27,088 INFO L225 Difference]: With dead ends: 7423
[2024-10-29 15:23:27,088 INFO L226 Difference]: Without dead ends: 4069
[2024-10-29 15:23:27,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:27,107 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:27,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 481 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4069 states.
[2024-10-29 15:23:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4069 to 3400.
[2024-10-29 15:23:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3374 states have (on average 2.128037937166568) internal successors, (7180), 3399 states have internal predecessors, (7180), 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:23:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 7180 transitions.
[2024-10-29 15:23:27,248 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 7180 transitions. Word has length 65
[2024-10-29 15:23:27,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:27,253 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 7180 transitions.
[2024-10-29 15:23:27,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 7180 transitions.
[2024-10-29 15:23:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-29 15:23:27,254 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:27,254 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]
[2024-10-29 15:23:27,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-10-29 15:23:27,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1566317822, now seen corresponding path program 1 times
[2024-10-29 15:23:27,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:27,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150071873]
[2024-10-29 15:23:27,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:27,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:27,377 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:23:27,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:27,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150071873]
[2024-10-29 15:23:27,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150071873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:27,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:27,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029639382]
[2024-10-29 15:23:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:27,382 INFO L87 Difference]: Start difference. First operand 3400 states and 7180 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:27,612 INFO L93 Difference]: Finished difference Result 7875 states and 16774 transitions.
[2024-10-29 15:23:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:27,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65
[2024-10-29 15:23:27,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:27,653 INFO L225 Difference]: With dead ends: 7875
[2024-10-29 15:23:27,653 INFO L226 Difference]: Without dead ends: 4530
[2024-10-29 15:23:27,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:27,669 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 199 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:27,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 608 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states.
[2024-10-29 15:23:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 3498.
[2024-10-29 15:23:27,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3498 states, 3472 states have (on average 2.1287442396313363) internal successors, (7391), 3497 states have internal predecessors, (7391), 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:23:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 7391 transitions.
[2024-10-29 15:23:27,825 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 7391 transitions. Word has length 65
[2024-10-29 15:23:27,825 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:27,825 INFO L471 AbstractCegarLoop]: Abstraction has 3498 states and 7391 transitions.
[2024-10-29 15:23:27,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 7391 transitions.
[2024-10-29 15:23:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-29 15:23:27,826 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:27,826 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]
[2024-10-29 15:23:27,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-10-29 15:23:27,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:27,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:27,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1584821290, now seen corresponding path program 1 times
[2024-10-29 15:23:27,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:27,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794773146]
[2024-10-29 15:23:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:23:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794773146]
[2024-10-29 15:23:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794773146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157594120]
[2024-10-29 15:23:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:27,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:27,886 INFO L87 Difference]: Start difference. First operand 3498 states and 7391 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:27,981 INFO L93 Difference]: Finished difference Result 7803 states and 16656 transitions.
[2024-10-29 15:23:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65
[2024-10-29 15:23:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:27,999 INFO L225 Difference]: With dead ends: 7803
[2024-10-29 15:23:27,999 INFO L226 Difference]: Without dead ends: 4378
[2024-10-29 15:23:28,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:28,008 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 186 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:28,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 517 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4378 states.
[2024-10-29 15:23:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4378 to 3955.
[2024-10-29 15:23:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3955 states, 3929 states have (on average 2.1303130567574446) internal successors, (8370), 3954 states have internal predecessors, (8370), 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:23:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3955 states to 3955 states and 8370 transitions.
[2024-10-29 15:23:28,077 INFO L78 Accepts]: Start accepts. Automaton has 3955 states and 8370 transitions. Word has length 65
[2024-10-29 15:23:28,077 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:28,078 INFO L471 AbstractCegarLoop]: Abstraction has 3955 states and 8370 transitions.
[2024-10-29 15:23:28,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3955 states and 8370 transitions.
[2024-10-29 15:23:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-10-29 15:23:28,078 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:28,078 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]
[2024-10-29 15:23:28,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-10-29 15:23:28,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:28,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:28,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1077689753, now seen corresponding path program 1 times
[2024-10-29 15:23:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:28,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177640337]
[2024-10-29 15:23:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:28,145 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:23:28,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:28,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177640337]
[2024-10-29 15:23:28,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177640337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:28,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:28,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:28,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159304708]
[2024-10-29 15:23:28,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:28,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:28,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:28,147 INFO L87 Difference]: Start difference. First operand 3955 states and 8370 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:28,253 INFO L93 Difference]: Finished difference Result 8229 states and 17541 transitions.
[2024-10-29 15:23:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65
[2024-10-29 15:23:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:28,272 INFO L225 Difference]: With dead ends: 8229
[2024-10-29 15:23:28,273 INFO L226 Difference]: Without dead ends: 4348
[2024-10-29 15:23:28,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:28,281 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 181 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:28,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 606 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4348 states.
[2024-10-29 15:23:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4348 to 3987.
[2024-10-29 15:23:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3961 states have (on average 2.129765210805352) internal successors, (8436), 3986 states have internal predecessors, (8436), 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:23:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 8436 transitions.
[2024-10-29 15:23:28,372 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 8436 transitions. Word has length 65
[2024-10-29 15:23:28,373 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:28,373 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 8436 transitions.
[2024-10-29 15:23:28,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:23:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 8436 transitions.
[2024-10-29 15:23:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-29 15:23:28,376 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:28,376 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]
[2024-10-29 15:23:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-10-29 15:23:28,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 274074850, now seen corresponding path program 1 times
[2024-10-29 15:23:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939298928]
[2024-10-29 15:23:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:28,454 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:23:28,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939298928]
[2024-10-29 15:23:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939298928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29380823]
[2024-10-29 15:23:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:28,455 INFO L87 Difference]: Start difference. First operand 3987 states and 8436 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:23:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:28,549 INFO L93 Difference]: Finished difference Result 8447 states and 18030 transitions.
[2024-10-29 15:23:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66
[2024-10-29 15:23:28,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:28,566 INFO L225 Difference]: With dead ends: 8447
[2024-10-29 15:23:28,566 INFO L226 Difference]: Without dead ends: 4532
[2024-10-29 15:23:28,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:28,573 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 102 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:28,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 515 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states.
[2024-10-29 15:23:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4225.
[2024-10-29 15:23:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4225 states, 4199 states have (on average 2.136699214098595) internal successors, (8972), 4224 states have internal predecessors, (8972), 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:23:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4225 states to 4225 states and 8972 transitions.
[2024-10-29 15:23:28,640 INFO L78 Accepts]: Start accepts. Automaton has 4225 states and 8972 transitions. Word has length 66
[2024-10-29 15:23:28,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:28,640 INFO L471 AbstractCegarLoop]: Abstraction has 4225 states and 8972 transitions.
[2024-10-29 15:23:28,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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:23:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4225 states and 8972 transitions.
[2024-10-29 15:23:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2024-10-29 15:23:28,641 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:28,641 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]
[2024-10-29 15:23:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-10-29 15:23:28,642 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 240828094, now seen corresponding path program 1 times
[2024-10-29 15:23:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124610604]
[2024-10-29 15:23:28,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:28,674 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:23:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124610604]
[2024-10-29 15:23:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124610604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:28,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:28,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341954302]
[2024-10-29 15:23:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:28,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:28,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:28,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:28,676 INFO L87 Difference]: Start difference. First operand 4225 states and 8972 transitions. Second operand has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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:23:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:28,740 INFO L93 Difference]: Finished difference Result 4324 states and 9179 transitions.
[2024-10-29 15:23:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66
[2024-10-29 15:23:28,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:28,759 INFO L225 Difference]: With dead ends: 4324
[2024-10-29 15:23:28,759 INFO L226 Difference]: Without dead ends: 4284
[2024-10-29 15:23:28,760 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:23:28,760 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 41 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:28,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 351 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states.
[2024-10-29 15:23:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4224.
[2024-10-29 15:23:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4224 states, 4201 states have (on average 2.135920019043085) internal successors, (8973), 4223 states have internal predecessors, (8973), 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:23:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4224 states to 4224 states and 8973 transitions.
[2024-10-29 15:23:28,845 INFO L78 Accepts]: Start accepts. Automaton has 4224 states and 8973 transitions. Word has length 66
[2024-10-29 15:23:28,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:28,846 INFO L471 AbstractCegarLoop]: Abstraction has 4224 states and 8973 transitions.
[2024-10-29 15:23:28,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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:23:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 4224 states and 8973 transitions.
[2024-10-29 15:23:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2024-10-29 15:23:28,847 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:28,847 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]
[2024-10-29 15:23:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-10-29 15:23:28,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1557053592, now seen corresponding path program 1 times
[2024-10-29 15:23:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195569935]
[2024-10-29 15:23:28,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:28,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:29,213 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:23:29,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:29,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195569935]
[2024-10-29 15:23:29,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195569935] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:29,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:29,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426943961]
[2024-10-29 15:23:29,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:29,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:29,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:29,215 INFO L87 Difference]: Start difference. First operand 4224 states and 8973 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 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:23:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:29,353 INFO L93 Difference]: Finished difference Result 4420 states and 9351 transitions.
[2024-10-29 15:23:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:29,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 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 78
[2024-10-29 15:23:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:29,375 INFO L225 Difference]: With dead ends: 4420
[2024-10-29 15:23:29,375 INFO L226 Difference]: Without dead ends: 4380
[2024-10-29 15:23:29,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:29,377 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 162 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:29,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 662 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states.
[2024-10-29 15:23:29,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4324.
[2024-10-29 15:23:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4324 states, 4303 states have (on average 2.133860097606321) internal successors, (9182), 4323 states have internal predecessors, (9182), 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:23:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4324 states to 4324 states and 9182 transitions.
[2024-10-29 15:23:29,462 INFO L78 Accepts]: Start accepts. Automaton has 4324 states and 9182 transitions. Word has length 78
[2024-10-29 15:23:29,463 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:29,463 INFO L471 AbstractCegarLoop]: Abstraction has 4324 states and 9182 transitions.
[2024-10-29 15:23:29,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 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:23:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4324 states and 9182 transitions.
[2024-10-29 15:23:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2024-10-29 15:23:29,464 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:29,464 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]
[2024-10-29 15:23:29,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-29 15:23:29,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:29,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:29,465 INFO L85 PathProgramCache]: Analyzing trace with hash 986820245, now seen corresponding path program 1 times
[2024-10-29 15:23:29,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:29,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911811163]
[2024-10-29 15:23:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:29,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:29,732 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:23:29,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:29,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911811163]
[2024-10-29 15:23:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911811163] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:29,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741917251]
[2024-10-29 15:23:29,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:29,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:29,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:29,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:29,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:29,733 INFO L87 Difference]: Start difference. First operand 4324 states and 9182 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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:23:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:29,982 INFO L93 Difference]: Finished difference Result 4424 states and 9364 transitions.
[2024-10-29 15:23:29,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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 92
[2024-10-29 15:23:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:29,999 INFO L225 Difference]: With dead ends: 4424
[2024-10-29 15:23:29,999 INFO L226 Difference]: Without dead ends: 4319
[2024-10-29 15:23:30,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:30,000 INFO L432 NwaCegarLoop]: 468 mSDtfsCounter, 346 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:30,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1350 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4319 states.
[2024-10-29 15:23:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4319 to 4287.
[2024-10-29 15:23:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4287 states, 4267 states have (on average 2.1298336067494725) internal successors, (9088), 4286 states have internal predecessors, (9088), 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:23:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 9088 transitions.
[2024-10-29 15:23:30,066 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 9088 transitions. Word has length 92
[2024-10-29 15:23:30,066 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:30,066 INFO L471 AbstractCegarLoop]: Abstraction has 4287 states and 9088 transitions.
[2024-10-29 15:23:30,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 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:23:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 9088 transitions.
[2024-10-29 15:23:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2024-10-29 15:23:30,067 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:30,067 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]
[2024-10-29 15:23:30,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-10-29 15:23:30,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 989476586, now seen corresponding path program 1 times
[2024-10-29 15:23:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104025732]
[2024-10-29 15:23:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:30,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:30,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104025732]
[2024-10-29 15:23:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104025732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:30,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:30,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776555577]
[2024-10-29 15:23:30,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:30,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:30,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:30,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:30,313 INFO L87 Difference]: Start difference. First operand 4287 states and 9088 transitions. Second operand has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 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:23:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:30,418 INFO L93 Difference]: Finished difference Result 4464 states and 9417 transitions.
[2024-10-29 15:23:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 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 96
[2024-10-29 15:23:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:30,434 INFO L225 Difference]: With dead ends: 4464
[2024-10-29 15:23:30,434 INFO L226 Difference]: Without dead ends: 4342
[2024-10-29 15:23:30,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:30,435 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 148 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:30,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 616 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states.
[2024-10-29 15:23:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4317.
[2024-10-29 15:23:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 4298 states have (on average 2.1316891577477897) internal successors, (9162), 4316 states have internal predecessors, (9162), 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:23:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 9162 transitions.
[2024-10-29 15:23:30,493 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 9162 transitions. Word has length 96
[2024-10-29 15:23:30,493 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:30,494 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 9162 transitions.
[2024-10-29 15:23:30,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 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:23:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 9162 transitions.
[2024-10-29 15:23:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2024-10-29 15:23:30,496 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:30,496 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]
[2024-10-29 15:23:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-10-29 15:23:30,497 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1306385121, now seen corresponding path program 1 times
[2024-10-29 15:23:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606316141]
[2024-10-29 15:23:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:30,528 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:23:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:30,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606316141]
[2024-10-29 15:23:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606316141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7672209]
[2024-10-29 15:23:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:30,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:30,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:30,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:30,530 INFO L87 Difference]: Start difference. First operand 4317 states and 9162 transitions. Second operand has 3 states, 2 states have (on average 52.0) internal successors, (104), 3 states have internal predecessors, (104), 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:23:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:30,574 INFO L93 Difference]: Finished difference Result 4677 states and 9932 transitions.
[2024-10-29 15:23:30,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:30,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 52.0) internal successors, (104), 3 states have internal predecessors, (104), 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 104
[2024-10-29 15:23:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:30,593 INFO L225 Difference]: With dead ends: 4677
[2024-10-29 15:23:30,594 INFO L226 Difference]: Without dead ends: 4067
[2024-10-29 15:23:30,595 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:23:30,596 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 99 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:30,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 398 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states.
[2024-10-29 15:23:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3848.
[2024-10-29 15:23:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3848 states, 3836 states have (on average 2.127215849843587) internal successors, (8160), 3847 states have internal predecessors, (8160), 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:23:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 8160 transitions.
[2024-10-29 15:23:30,653 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 8160 transitions. Word has length 104
[2024-10-29 15:23:30,654 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:30,654 INFO L471 AbstractCegarLoop]: Abstraction has 3848 states and 8160 transitions.
[2024-10-29 15:23:30,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 52.0) internal successors, (104), 3 states have internal predecessors, (104), 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:23:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 8160 transitions.
[2024-10-29 15:23:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-10-29 15:23:30,656 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:30,656 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]
[2024-10-29 15:23:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-10-29 15:23:30,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:30,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1332332550, now seen corresponding path program 1 times
[2024-10-29 15:23:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458287426]
[2024-10-29 15:23:30,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458287426]
[2024-10-29 15:23:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458287426] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-10-29 15:23:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492210669]
[2024-10-29 15:23:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-10-29 15:23:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:31,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-10-29 15:23:31,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2024-10-29 15:23:31,093 INFO L87 Difference]: Start difference. First operand 3848 states and 8160 transitions. Second operand has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 12 states have internal predecessors, (105), 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:23:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:31,364 INFO L93 Difference]: Finished difference Result 3848 states and 8160 transitions.
[2024-10-29 15:23:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:23:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 12 states have internal predecessors, (105), 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 105
[2024-10-29 15:23:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:31,379 INFO L225 Difference]: With dead ends: 3848
[2024-10-29 15:23:31,380 INFO L226 Difference]: Without dead ends: 3716
[2024-10-29 15:23:31,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380
[2024-10-29 15:23:31,381 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 340 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:31,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1359 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states.
[2024-10-29 15:23:31,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3697.
[2024-10-29 15:23:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3697 states, 3687 states have (on average 2.134797938703553) internal successors, (7871), 3696 states have internal predecessors, (7871), 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:23:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3697 states to 3697 states and 7871 transitions.
[2024-10-29 15:23:31,431 INFO L78 Accepts]: Start accepts. Automaton has 3697 states and 7871 transitions. Word has length 105
[2024-10-29 15:23:31,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:31,432 INFO L471 AbstractCegarLoop]: Abstraction has 3697 states and 7871 transitions.
[2024-10-29 15:23:31,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 12 states have internal predecessors, (105), 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:23:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3697 states and 7871 transitions.
[2024-10-29 15:23:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-10-29 15:23:31,434 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:31,434 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]
[2024-10-29 15:23:31,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-10-29 15:23:31,434 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:31,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1574003469, now seen corresponding path program 1 times
[2024-10-29 15:23:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:31,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953151099]
[2024-10-29 15:23:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:32,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:32,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953151099]
[2024-10-29 15:23:32,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953151099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:32,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:32,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-29 15:23:32,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459415210]
[2024-10-29 15:23:32,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:23:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:23:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:23:32,101 INFO L87 Difference]: Start difference. First operand 3697 states and 7871 transitions. Second operand has 11 states, 10 states have (on average 10.5) internal successors, (105), 11 states have internal predecessors, (105), 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:23:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:32,540 INFO L93 Difference]: Finished difference Result 3697 states and 7871 transitions.
[2024-10-29 15:23:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:23:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.5) internal successors, (105), 11 states have internal predecessors, (105), 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 105
[2024-10-29 15:23:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:32,559 INFO L225 Difference]: With dead ends: 3697
[2024-10-29 15:23:32,560 INFO L226 Difference]: Without dead ends: 3557
[2024-10-29 15:23:32,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342
[2024-10-29 15:23:32,561 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 509 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:32,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1939 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:23:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states.
[2024-10-29 15:23:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 3530.
[2024-10-29 15:23:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 3523 states have (on average 2.1447629860913993) internal successors, (7556), 3529 states have internal predecessors, (7556), 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:23:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 7556 transitions.
[2024-10-29 15:23:32,626 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 7556 transitions. Word has length 105
[2024-10-29 15:23:32,626 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:32,626 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 7556 transitions.
[2024-10-29 15:23:32,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 10.5) internal successors, (105), 11 states have internal predecessors, (105), 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:23:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 7556 transitions.
[2024-10-29 15:23:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-10-29 15:23:32,630 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:32,630 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:32,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-10-29 15:23:32,630 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash -786149150, now seen corresponding path program 1 times
[2024-10-29 15:23:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:32,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685143773]
[2024-10-29 15:23:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:23:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685143773]
[2024-10-29 15:23:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685143773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:32,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-29 15:23:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052766893]
[2024-10-29 15:23:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:32,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-29 15:23:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:32,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-29 15:23:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-10-29 15:23:32,884 INFO L87 Difference]: Start difference. First operand 3530 states and 7556 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:33,227 INFO L93 Difference]: Finished difference Result 8691 states and 18762 transitions.
[2024-10-29 15:23:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-10-29 15:23:33,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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 113
[2024-10-29 15:23:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:33,246 INFO L225 Difference]: With dead ends: 8691
[2024-10-29 15:23:33,246 INFO L226 Difference]: Without dead ends: 6215
[2024-10-29 15:23:33,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182
[2024-10-29 15:23:33,251 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 316 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:33,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1088 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states.
[2024-10-29 15:23:33,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5072.
[2024-10-29 15:23:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5072 states, 5065 states have (on average 2.145705824284304) internal successors, (10868), 5071 states have internal predecessors, (10868), 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:23:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 10868 transitions.
[2024-10-29 15:23:33,313 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 10868 transitions. Word has length 113
[2024-10-29 15:23:33,314 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:33,314 INFO L471 AbstractCegarLoop]: Abstraction has 5072 states and 10868 transitions.
[2024-10-29 15:23:33,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:33,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 10868 transitions.
[2024-10-29 15:23:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-10-29 15:23:33,317 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:33,317 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:33,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-10-29 15:23:33,318 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:33,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1844164866, now seen corresponding path program 1 times
[2024-10-29 15:23:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:33,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294672732]
[2024-10-29 15:23:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:23:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294672732]
[2024-10-29 15:23:33,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294672732] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:33,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:33,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-29 15:23:33,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241417272]
[2024-10-29 15:23:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:33,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-29 15:23:33,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:33,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-29 15:23:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-10-29 15:23:33,428 INFO L87 Difference]: Start difference. First operand 5072 states and 10868 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:33,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:33,674 INFO L93 Difference]: Finished difference Result 7564 states and 16133 transitions.
[2024-10-29 15:23:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-10-29 15:23:33,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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 113
[2024-10-29 15:23:33,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:33,695 INFO L225 Difference]: With dead ends: 7564
[2024-10-29 15:23:33,695 INFO L226 Difference]: Without dead ends: 6206
[2024-10-29 15:23:33,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182
[2024-10-29 15:23:33,699 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 367 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:33,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 978 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states.
[2024-10-29 15:23:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5183.
[2024-10-29 15:23:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5183 states, 5176 states have (on average 2.142967542503864) internal successors, (11092), 5182 states have internal predecessors, (11092), 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:23:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5183 states to 5183 states and 11092 transitions.
[2024-10-29 15:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has 5183 states and 11092 transitions. Word has length 113
[2024-10-29 15:23:33,777 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:33,777 INFO L471 AbstractCegarLoop]: Abstraction has 5183 states and 11092 transitions.
[2024-10-29 15:23:33,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5183 states and 11092 transitions.
[2024-10-29 15:23:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-10-29 15:23:33,782 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:33,782 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-10-29 15:23:33,782 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1080621567, now seen corresponding path program 1 times
[2024-10-29 15:23:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906984529]
[2024-10-29 15:23:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:33,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:23:33,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:33,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906984529]
[2024-10-29 15:23:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906984529] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:33,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:33,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-29 15:23:33,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008411502]
[2024-10-29 15:23:33,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:33,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-29 15:23:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-29 15:23:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-29 15:23:33,872 INFO L87 Difference]: Start difference. First operand 5183 states and 11092 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:23:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:33,968 INFO L93 Difference]: Finished difference Result 8908 states and 19157 transitions.
[2024-10-29 15:23:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-29 15:23:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 113
[2024-10-29 15:23:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:33,989 INFO L225 Difference]: With dead ends: 8908
[2024-10-29 15:23:33,989 INFO L226 Difference]: Without dead ends: 5452
[2024-10-29 15:23:33,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-10-29 15:23:33,996 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 99 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:33,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 439 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states.
[2024-10-29 15:23:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 5171.
[2024-10-29 15:23:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5171 states, 5164 states have (on average 2.1376839659178932) internal successors, (11039), 5170 states have internal predecessors, (11039), 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:23:34,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5171 states to 5171 states and 11039 transitions.
[2024-10-29 15:23:34,062 INFO L78 Accepts]: Start accepts. Automaton has 5171 states and 11039 transitions. Word has length 113
[2024-10-29 15:23:34,062 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:34,063 INFO L471 AbstractCegarLoop]: Abstraction has 5171 states and 11039 transitions.
[2024-10-29 15:23:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:23:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5171 states and 11039 transitions.
[2024-10-29 15:23:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2024-10-29 15:23:34,067 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:34,067 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-10-29 15:23:34,067 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:34,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1294028965, now seen corresponding path program 1 times
[2024-10-29 15:23:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988231160]
[2024-10-29 15:23:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-29 15:23:34,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-29 15:23:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988231160]
[2024-10-29 15:23:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988231160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:34,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:34,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-10-29 15:23:34,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595589888]
[2024-10-29 15:23:34,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:34,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-29 15:23:34,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-29 15:23:34,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-29 15:23:34,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-10-29 15:23:34,172 INFO L87 Difference]: Start difference. First operand 5171 states and 11039 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:34,420 INFO L93 Difference]: Finished difference Result 8270 states and 17507 transitions.
[2024-10-29 15:23:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-10-29 15:23:34,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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 113
[2024-10-29 15:23:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:34,449 INFO L225 Difference]: With dead ends: 8270
[2024-10-29 15:23:34,449 INFO L226 Difference]: Without dead ends: 5910
[2024-10-29 15:23:34,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182
[2024-10-29 15:23:34,455 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 360 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:34,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1131 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states.
[2024-10-29 15:23:34,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 5117.
[2024-10-29 15:23:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5117 states, 5110 states have (on average 2.11174168297456) internal successors, (10791), 5116 states have internal predecessors, (10791), 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:23:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5117 states to 5117 states and 10791 transitions.
[2024-10-29 15:23:34,543 INFO L78 Accepts]: Start accepts. Automaton has 5117 states and 10791 transitions. Word has length 113
[2024-10-29 15:23:34,543 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:34,543 INFO L471 AbstractCegarLoop]: Abstraction has 5117 states and 10791 transitions.
[2024-10-29 15:23:34,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 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:23:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5117 states and 10791 transitions.
[2024-10-29 15:23:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2024-10-29 15:23:34,547 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:34,547 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:34,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-10-29 15:23:34,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:34,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1949261534, now seen corresponding path program 1 times
[2024-10-29 15:23:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-29 15:23:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888745407]
[2024-10-29 15:23:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-29 15:23:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:23:34,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:23:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:23:34,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-29 15:23:34,625 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:23:34,626 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining)
[2024-10-29 15:23:34,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining)
[2024-10-29 15:23:34,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining)
[2024-10-29 15:23:34,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining)
[2024-10-29 15:23:34,628 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining)
[2024-10-29 15:23:34,629 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining)
[2024-10-29 15:23:34,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining)
[2024-10-29 15:23:34,630 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining)
[2024-10-29 15:23:34,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-10-29 15:23:34,632 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:34,684 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-29 15:23:34,684 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-29 15:23:34,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:23:34 BasicIcfg
[2024-10-29 15:23:34,686 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-29 15:23:34,688 INFO L158 Benchmark]: Toolchain (without parser) took 11670.51ms. Allocated memory was 190.8MB in the beginning and 782.2MB in the end (delta: 591.4MB). Free memory was 162.1MB in the beginning and 410.9MB in the end (delta: -248.7MB). Peak memory consumption was 341.3MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,688 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:23:34,690 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 119.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:23:34,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.77ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 130.3MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.29ms. Allocated memory is still 190.8MB. Free memory was 130.3MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,691 INFO L158 Benchmark]: Boogie Preprocessor took 42.81ms. Allocated memory is still 190.8MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,691 INFO L158 Benchmark]: RCFGBuilder took 516.79ms. Allocated memory is still 190.8MB. Free memory was 125.1MB in the beginning and 102.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,691 INFO L158 Benchmark]: TraceAbstraction took 10577.41ms. Allocated memory was 190.8MB in the beginning and 782.2MB in the end (delta: 591.4MB). Free memory was 100.9MB in the beginning and 410.9MB in the end (delta: -309.9MB). Peak memory consumption was 280.4MB. Max. memory is 16.1GB.
[2024-10-29 15:23:34,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Witness Parser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CDTParser took 0.07ms. Allocated memory is still 127.9MB. Free memory was 100.1MB in the beginning and 100.0MB in the end (delta: 119.7kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 475.77ms. Allocated memory is still 190.8MB. Free memory was 162.1MB in the beginning and 130.3MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 51.29ms. Allocated memory is still 190.8MB. Free memory was 130.3MB in the beginning and 127.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 42.81ms. Allocated memory is still 190.8MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 516.79ms. Allocated memory is still 190.8MB. Free memory was 125.1MB in the beginning and 102.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
* TraceAbstraction took 10577.41ms. Allocated memory was 190.8MB in the beginning and 782.2MB in the end (delta: 591.4MB). Free memory was 100.9MB in the beginning and 410.9MB in the end (delta: -309.9MB). Peak memory consumption was 280.4MB. Max. memory is 16.1GB.
* 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
- UnprovableResult [Line: 1058]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1059.
Possible FailurePath:
[L1043] 0 int threads_mask = -1;
VAL [threads_mask=-1]
[L1044] 0 int *datas;
VAL [datas={0:0}, threads_mask=-1]
[L1052] 0 int threads_total = __VERIFIER_nondet_int();
VAL [datas={0:0}, threads_mask=-1, threads_total=31]
[L1053] CALL 0 assume_abort_if_not(threads_total >= 0)
[L1040] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1]
[L1053] RET 0 assume_abort_if_not(threads_total >= 0)
[L1054] CALL 0 assume_abort_if_not(threads_total < 32)
[L1040] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1]
[L1054] RET 0 assume_abort_if_not(threads_total < 32)
[L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1056] 0 datas = malloc(threads_total * sizeof(int))
VAL [datas={-4:0}, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1057] 0 int i = 0;
VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1057] COND TRUE 0 i < threads_total
VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1058] EXPR 0 ffs(threads_mask)
VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1058] 0 int j = ffs(threads_mask) - 1;
VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1059] 0 threads_mask &= ~(1 << j)
VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1059] EXPR 0 1 << j
VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}]
[L1059] 0 threads_mask &= ~(1 << j)
VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}]
[L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}]
[L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
VAL [\old(arg)={0:0}, datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}]
[L1057] 0 i++
VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}]
[L1057] COND TRUE 0 i < threads_total
VAL [\old(arg)={0:0}, datas={-4:0}, i=1, threads_mask=-2, threads_total=31, tids={-3:0}]
[L1046] 1 int j = (int)arg;
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2]
[L1047] EXPR 1 datas[j]
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2]
[L1047] 1 datas[j] = __VERIFIER_nondet_int()
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2]
[L1048] 1 threads_mask |= 1 << j
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2]
[L1048] EXPR 1 1 << j
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2]
[L1048] 1 threads_mask |= 1 << j
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-1]
[L1058] 0 ffs(threads_mask)
VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-1, threads_total=31, tids={-3:0}]
- UnprovableResult [Line: 1056]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1066]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1063]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1059]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1059]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1060]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1060]: 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: 1047]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1047]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1048]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1048]: 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, 209 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4222 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4222 mSDsluCounter, 15381 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9752 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3585 IncrementalHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 5629 mSDtfsCounter, 3585 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5183occurred in iteration=20, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 7899 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1806 NumberOfCodeBlocks, 1806 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1670 ConstructedInterpolants, 0 QuantifiedInterpolants, 5448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 15/15 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 could not prove your program: unable to determine feasibility of some traces
[2024-10-29 15:23:34,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
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/per-thread-index-bitmask-race.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-index-bitmask-race.yml/witness.graphml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-194c01f-m
[2024-10-29 15:23:36,758 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-29 15:23:36,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2024-10-29 15:23:36,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-29 15:23:36,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-29 15:23:36,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-29 15:23:36,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-29 15:23:36,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-29 15:23:36,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-29 15:23:36,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-29 15:23:36,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-29 15:23:36,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-29 15:23:36,860 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-29 15:23:36,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-29 15:23:36,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-29 15:23:36,861 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-29 15:23:36,861 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-29 15:23:36,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-29 15:23:36,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-29 15:23:36,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-29 15:23:36,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-29 15:23:36,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-29 15:23:36,866 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-29 15:23:36,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-29 15:23:36,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-29 15:23:36,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:23:36,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-10-29 15:23:36,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-29 15:23:36,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-29 15:23:36,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-29 15:23:36,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-29 15:23:36,869 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2024-10-29 15:23:36,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None
[2024-10-29 15:23:37,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-29 15:23:37,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-29 15:23:37,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-29 15:23:37,164 INFO L270 PluginConnector]: Initializing Witness Parser...
[2024-10-29 15:23:37,165 INFO L274 PluginConnector]: Witness Parser initialized
[2024-10-29 15:23:37,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/per-thread-index-bitmask-race.yml/witness.graphml
[2024-10-29 15:23:37,229 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-29 15:23:37,229 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-29 15:23:37,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i
[2024-10-29 15:23:38,780 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-29 15:23:39,011 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-29 15:23:39,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i
[2024-10-29 15:23:39,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15dbdb28/07daf093c03b4edc93e70ec9f2da0c70/FLAG30a655be9
[2024-10-29 15:23:39,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a15dbdb28/07daf093c03b4edc93e70ec9f2da0c70
[2024-10-29 15:23:39,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-29 15:23:39,046 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-10-29 15:23:39,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-29 15:23:39,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-29 15:23:39,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-29 15:23:39,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:37" (1/2) ...
[2024-10-29 15:23:39,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b61a05 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:39, skipping insertion in model container
[2024-10-29 15:23:39,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:37" (1/2) ...
[2024-10-29 15:23:39,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7196de8a and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:23:39, skipping insertion in model container
[2024-10-29 15:23:39,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:39" (2/2) ...
[2024-10-29 15:23:39,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b61a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39, skipping insertion in model container
[2024-10-29 15:23:39,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:23:39" (2/2) ...
[2024-10-29 15:23:39,086 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-29 15:23:39,466 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:23:39,475 INFO L200 MainTranslator]: Completed pre-run
[2024-10-29 15:23:39,519 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-29 15:23:39,571 INFO L204 MainTranslator]: Completed translation
[2024-10-29 15:23:39,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39 WrapperNode
[2024-10-29 15:23:39,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-29 15:23:39,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-29 15:23:39,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-29 15:23:39,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-29 15:23:39,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,628 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90
[2024-10-29 15:23:39,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-29 15:23:39,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-29 15:23:39,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-29 15:23:39,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-29 15:23:39,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-29 15:23:39,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-29 15:23:39,673 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-29 15:23:39,673 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-29 15:23:39,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (1/1) ...
[2024-10-29 15:23:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-29 15:23:39,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-29 15:23:39,717 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:23:39,718 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:23:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2024-10-29 15:23:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-10-29 15:23:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2024-10-29 15:23:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-10-29 15:23:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread
[2024-10-29 15:23:39,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread
[2024-10-29 15:23:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-29 15:23:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-29 15:23:39,754 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:23:39,862 INFO L238 CfgBuilder]: Building ICFG
[2024-10-29 15:23:39,864 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-29 15:23:40,198 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-29 15:23:40,199 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-29 15:23:40,212 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-29 15:23:40,212 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-10-29 15:23:40,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:40 BoogieIcfgContainer
[2024-10-29 15:23:40,213 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-29 15:23:40,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-29 15:23:40,214 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-29 15:23:40,219 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-29 15:23:40,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:23:37" (1/4) ...
[2024-10-29 15:23:40,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e73975 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:23:40, skipping insertion in model container
[2024-10-29 15:23:40,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:23:39" (2/4) ...
[2024-10-29 15:23:40,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e73975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:40, skipping insertion in model container
[2024-10-29 15:23:40,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:23:39" (3/4) ...
[2024-10-29 15:23:40,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e73975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:23:40, skipping insertion in model container
[2024-10-29 15:23:40,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:23:40" (4/4) ...
[2024-10-29 15:23:40,223 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-10-29 15:23:40,224 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton
[2024-10-29 15:23:40,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-29 15:23:40,242 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2024-10-29 15:23:40,242 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-29 15:23:40,298 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-10-29 15:23:40,310 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:23:40,319 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 134 transitions, 275 flow
[2024-10-29 15:23:40,392 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1795 states, 1743 states have (on average 2.010327022375215) internal successors, (3504), 1794 states have internal predecessors, (3504), 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:23:40,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-29 15:23:40,422 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;@66282274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-29 15:23:40,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2024-10-29 15:23:40,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 1795 states, 1743 states have (on average 2.010327022375215) internal successors, (3504), 1794 states have internal predecessors, (3504), 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:23:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-10-29 15:23:40,432 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:40,432 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]
[2024-10-29 15:23:40,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:40,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:40,436 INFO L85 PathProgramCache]: Analyzing trace with hash 825090929, now seen corresponding path program 1 times
[2024-10-29 15:23:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454638983]
[2024-10-29 15:23:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:40,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:40,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:40,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:40,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-10-29 15:23:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:40,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:40,527 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:40,557 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:23:40,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:40,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454638983]
[2024-10-29 15:23:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454638983] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:40,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843282558]
[2024-10-29 15:23:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:40,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:40,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:40,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:40,611 INFO L87 Difference]: Start difference. First operand has 1795 states, 1743 states have (on average 2.010327022375215) internal successors, (3504), 1794 states have internal predecessors, (3504), 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 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:23:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:40,694 INFO L93 Difference]: Finished difference Result 3574 states and 6992 transitions.
[2024-10-29 15:23:40,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:40,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30
[2024-10-29 15:23:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:40,727 INFO L225 Difference]: With dead ends: 3574
[2024-10-29 15:23:40,727 INFO L226 Difference]: Without dead ends: 1767
[2024-10-29 15:23:40,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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:23:40,740 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 240 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states.
[2024-10-29 15:23:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767.
[2024-10-29 15:23:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1767 states, 1718 states have (on average 1.9743888242142025) internal successors, (3392), 1766 states have internal predecessors, (3392), 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:23:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 3392 transitions.
[2024-10-29 15:23:40,843 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 3392 transitions. Word has length 30
[2024-10-29 15:23:40,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 1767 states and 3392 transitions.
[2024-10-29 15:23:40,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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:23:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 3392 transitions.
[2024-10-29 15:23:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-10-29 15:23:40,845 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:40,845 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:40,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-10-29 15:23:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash -508688433, now seen corresponding path program 1 times
[2024-10-29 15:23:41,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:41,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218228497]
[2024-10-29 15:23:41,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:41,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:41,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:41,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-10-29 15:23:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:41,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:41,136 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:41,150 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:23:41,150 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:41,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:41,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218228497]
[2024-10-29 15:23:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218228497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:41,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:41,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:41,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133329001]
[2024-10-29 15:23:41,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:41,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:41,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:41,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:41,152 INFO L87 Difference]: Start difference. First operand 1767 states and 3392 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:41,237 INFO L93 Difference]: Finished difference Result 1932 states and 3708 transitions.
[2024-10-29 15:23:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:41,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36
[2024-10-29 15:23:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:41,246 INFO L225 Difference]: With dead ends: 1932
[2024-10-29 15:23:41,246 INFO L226 Difference]: Without dead ends: 1815
[2024-10-29 15:23:41,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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:23:41,248 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 80 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:41,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 295 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states.
[2024-10-29 15:23:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1704.
[2024-10-29 15:23:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1667 states have (on average 1.958008398320336) internal successors, (3264), 1703 states have internal predecessors, (3264), 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:23:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3264 transitions.
[2024-10-29 15:23:41,282 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3264 transitions. Word has length 36
[2024-10-29 15:23:41,282 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:41,282 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 3264 transitions.
[2024-10-29 15:23:41,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3264 transitions.
[2024-10-29 15:23:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2024-10-29 15:23:41,283 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:41,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:41,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-10-29 15:23:41,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:41,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1342900130, now seen corresponding path program 1 times
[2024-10-29 15:23:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:41,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831828425]
[2024-10-29 15:23:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:41,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:41,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:41,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-10-29 15:23:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:41,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:41,551 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:41,557 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:23:41,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:41,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:41,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831828425]
[2024-10-29 15:23:41,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831828425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:41,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:41,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479239260]
[2024-10-29 15:23:41,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:41,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:41,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:41,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:41,560 INFO L87 Difference]: Start difference. First operand 1704 states and 3264 transitions. Second operand has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:23:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:41,579 INFO L93 Difference]: Finished difference Result 1715 states and 3275 transitions.
[2024-10-29 15:23:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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 41
[2024-10-29 15:23:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:41,587 INFO L225 Difference]: With dead ends: 1715
[2024-10-29 15:23:41,587 INFO L226 Difference]: Without dead ends: 1606
[2024-10-29 15:23:41,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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:23:41,589 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 89 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:41,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 260 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states.
[2024-10-29 15:23:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1598.
[2024-10-29 15:23:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1572 states have (on average 1.94529262086514) internal successors, (3058), 1597 states have internal predecessors, (3058), 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:23:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 3058 transitions.
[2024-10-29 15:23:41,631 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 3058 transitions. Word has length 41
[2024-10-29 15:23:41,631 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:41,632 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 3058 transitions.
[2024-10-29 15:23:41,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.5) internal successors, (41), 3 states have internal predecessors, (41), 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:23:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 3058 transitions.
[2024-10-29 15:23:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2024-10-29 15:23:41,633 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:41,633 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]
[2024-10-29 15:23:41,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-10-29 15:23:41,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:41,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash 198282629, now seen corresponding path program 1 times
[2024-10-29 15:23:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:41,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618508848]
[2024-10-29 15:23:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:41,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:41,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:41,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-10-29 15:23:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:41,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:41,909 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:42,284 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:23:42,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:42,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:42,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618508848]
[2024-10-29 15:23:42,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618508848] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2024-10-29 15:23:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234898920]
[2024-10-29 15:23:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:42,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:23:42,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:23:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:23:42,290 INFO L87 Difference]: Start difference. First operand 1598 states and 3058 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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:23:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:42,694 INFO L93 Difference]: Finished difference Result 1606 states and 3065 transitions.
[2024-10-29 15:23:42,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-10-29 15:23:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 43
[2024-10-29 15:23:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:42,710 INFO L225 Difference]: With dead ends: 1606
[2024-10-29 15:23:42,710 INFO L226 Difference]: Without dead ends: 1596
[2024-10-29 15:23:42,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306
[2024-10-29 15:23:42,712 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 298 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:42,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 676 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-29 15:23:42,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states.
[2024-10-29 15:23:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596.
[2024-10-29 15:23:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1570 states have (on average 1.9458598726114649) internal successors, (3055), 1595 states have internal predecessors, (3055), 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:23:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 3055 transitions.
[2024-10-29 15:23:42,770 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 3055 transitions. Word has length 43
[2024-10-29 15:23:42,771 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:42,771 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 3055 transitions.
[2024-10-29 15:23:42,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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:23:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 3055 transitions.
[2024-10-29 15:23:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-10-29 15:23:42,775 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:42,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:42,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-10-29 15:23:42,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:42,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:42,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1473544567, now seen corresponding path program 1 times
[2024-10-29 15:23:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:42,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110292476]
[2024-10-29 15:23:42,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:42,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:42,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:42,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:42,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-10-29 15:23:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:43,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:43,024 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:43,094 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:23:43,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:43,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110292476]
[2024-10-29 15:23:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110292476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:43,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:43,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-29 15:23:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150018539]
[2024-10-29 15:23:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:43,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:43,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:43,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:43,096 INFO L87 Difference]: Start difference. First operand 1596 states and 3055 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:43,125 INFO L93 Difference]: Finished difference Result 3151 states and 6068 transitions.
[2024-10-29 15:23:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:43,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46
[2024-10-29 15:23:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:43,133 INFO L225 Difference]: With dead ends: 3151
[2024-10-29 15:23:43,134 INFO L226 Difference]: Without dead ends: 1595
[2024-10-29 15:23:43,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:23:43,137 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:43,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 206 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states.
[2024-10-29 15:23:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595.
[2024-10-29 15:23:43,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1569 states have (on average 1.9458253664754621) internal successors, (3053), 1594 states have internal predecessors, (3053), 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:23:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3053 transitions.
[2024-10-29 15:23:43,191 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3053 transitions. Word has length 46
[2024-10-29 15:23:43,192 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:43,192 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 3053 transitions.
[2024-10-29 15:23:43,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3053 transitions.
[2024-10-29 15:23:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2024-10-29 15:23:43,193 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:43,193 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]
[2024-10-29 15:23:43,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-10-29 15:23:43,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:43,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1220080592, now seen corresponding path program 1 times
[2024-10-29 15:23:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987020673]
[2024-10-29 15:23:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:43,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:43,399 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:43,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-10-29 15:23:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:43,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:43,480 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:43,491 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:23:43,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:43,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987020673]
[2024-10-29 15:23:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987020673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11270861]
[2024-10-29 15:23:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:43,492 INFO L87 Difference]: Start difference. First operand 1595 states and 3053 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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:23:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:43,540 INFO L93 Difference]: Finished difference Result 1624 states and 3107 transitions.
[2024-10-29 15:23:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48
[2024-10-29 15:23:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:43,550 INFO L225 Difference]: With dead ends: 1624
[2024-10-29 15:23:43,550 INFO L226 Difference]: Without dead ends: 1595
[2024-10-29 15:23:43,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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:23:43,551 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 25 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:43,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 247 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states.
[2024-10-29 15:23:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1585.
[2024-10-29 15:23:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1562 states have (on average 1.941741357234315) internal successors, (3033), 1584 states have internal predecessors, (3033), 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:23:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 3033 transitions.
[2024-10-29 15:23:43,579 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 3033 transitions. Word has length 48
[2024-10-29 15:23:43,579 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:43,579 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 3033 transitions.
[2024-10-29 15:23:43,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 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:23:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 3033 transitions.
[2024-10-29 15:23:43,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2024-10-29 15:23:43,580 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:43,580 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]
[2024-10-29 15:23:43,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-10-29 15:23:43,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:43,785 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:43,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 734470491, now seen corresponding path program 1 times
[2024-10-29 15:23:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703830711]
[2024-10-29 15:23:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:43,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:43,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:43,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:43,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-10-29 15:23:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:43,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:43,844 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:43,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-10-29 15:23:43,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-10-29 15:23:43,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:43,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-10-29 15:23:43,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:43,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-10-29 15:23:44,029 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:23:44,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:44,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:44,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703830711]
[2024-10-29 15:23:44,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703830711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:44,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455772080]
[2024-10-29 15:23:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:44,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:44,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:44,031 INFO L87 Difference]: Start difference. First operand 1585 states and 3033 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:23:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:44,177 INFO L93 Difference]: Finished difference Result 1711 states and 3260 transitions.
[2024-10-29 15:23:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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 58
[2024-10-29 15:23:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:44,184 INFO L225 Difference]: With dead ends: 1711
[2024-10-29 15:23:44,184 INFO L226 Difference]: Without dead ends: 1682
[2024-10-29 15:23:44,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:44,185 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 117 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:44,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 341 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-29 15:23:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states.
[2024-10-29 15:23:44,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1646.
[2024-10-29 15:23:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1625 states have (on average 1.9396923076923076) internal successors, (3152), 1645 states have internal predecessors, (3152), 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:23:44,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3152 transitions.
[2024-10-29 15:23:44,208 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3152 transitions. Word has length 58
[2024-10-29 15:23:44,208 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:44,208 INFO L471 AbstractCegarLoop]: Abstraction has 1646 states and 3152 transitions.
[2024-10-29 15:23:44,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 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:23:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3152 transitions.
[2024-10-29 15:23:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2024-10-29 15:23:44,210 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:44,210 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]
[2024-10-29 15:23:44,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2024-10-29 15:23:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:44,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash -694098063, now seen corresponding path program 1 times
[2024-10-29 15:23:44,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:44,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417497064]
[2024-10-29 15:23:44,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:44,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:44,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:44,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:44,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-10-29 15:23:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:44,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:44,501 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:44,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-10-29 15:23:44,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-10-29 15:23:44,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:44,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-10-29 15:23:44,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:44,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-10-29 15:23:44,601 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:23:44,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:44,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:44,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417497064]
[2024-10-29 15:23:44,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417497064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:44,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341766740]
[2024-10-29 15:23:44,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:44,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:44,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:44,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:44,603 INFO L87 Difference]: Start difference. First operand 1646 states and 3152 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:44,870 INFO L93 Difference]: Finished difference Result 1746 states and 3334 transitions.
[2024-10-29 15:23:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71
[2024-10-29 15:23:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:44,877 INFO L225 Difference]: With dead ends: 1746
[2024-10-29 15:23:44,877 INFO L226 Difference]: Without dead ends: 1685
[2024-10-29 15:23:44,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:44,879 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 200 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:44,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 656 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:23:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states.
[2024-10-29 15:23:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1653.
[2024-10-29 15:23:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1633 states have (on average 1.932639314145744) internal successors, (3156), 1652 states have internal predecessors, (3156), 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:23:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3156 transitions.
[2024-10-29 15:23:44,908 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3156 transitions. Word has length 71
[2024-10-29 15:23:44,908 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 3156 transitions.
[2024-10-29 15:23:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3156 transitions.
[2024-10-29 15:23:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-10-29 15:23:44,910 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:44,910 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]
[2024-10-29 15:23:44,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-10-29 15:23:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:45,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -810644308, now seen corresponding path program 1 times
[2024-10-29 15:23:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:45,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727513237]
[2024-10-29 15:23:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:45,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:45,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:45,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:45,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-10-29 15:23:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:45,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:45,196 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:45,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-10-29 15:23:45,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2024-10-29 15:23:45,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:45,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2024-10-29 15:23:45,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:45,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2024-10-29 15:23:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:45,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:45,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:45,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727513237]
[2024-10-29 15:23:45,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727513237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:45,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:45,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-29 15:23:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138520309]
[2024-10-29 15:23:45,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:45,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-29 15:23:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:45,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-29 15:23:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:45,304 INFO L87 Difference]: Start difference. First operand 1653 states and 3156 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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:23:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:45,624 INFO L93 Difference]: Finished difference Result 1770 states and 3357 transitions.
[2024-10-29 15:23:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-29 15:23:45,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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 76
[2024-10-29 15:23:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:45,631 INFO L225 Difference]: With dead ends: 1770
[2024-10-29 15:23:45,631 INFO L226 Difference]: Without dead ends: 1681
[2024-10-29 15:23:45,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-10-29 15:23:45,632 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 88 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:45,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 679 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:23:45,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states.
[2024-10-29 15:23:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1664.
[2024-10-29 15:23:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1645 states have (on average 1.9343465045592705) internal successors, (3182), 1663 states have internal predecessors, (3182), 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:23:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 3182 transitions.
[2024-10-29 15:23:45,652 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 3182 transitions. Word has length 76
[2024-10-29 15:23:45,652 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:45,652 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 3182 transitions.
[2024-10-29 15:23:45,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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:23:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 3182 transitions.
[2024-10-29 15:23:45,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2024-10-29 15:23:45,654 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:45,654 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]
[2024-10-29 15:23:45,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2024-10-29 15:23:45,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:45,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:45,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:45,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1862015287, now seen corresponding path program 1 times
[2024-10-29 15:23:45,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:45,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001707517]
[2024-10-29 15:23:45,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:45,858 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:45,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-10-29 15:23:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:45,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:45,937 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:45,943 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:23:45,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:45,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:45,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001707517]
[2024-10-29 15:23:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001707517] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-29 15:23:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945396549]
[2024-10-29 15:23:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:45,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-29 15:23:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:45,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-29 15:23:45,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-29 15:23:45,945 INFO L87 Difference]: Start difference. First operand 1664 states and 3182 transitions. Second operand has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:45,972 INFO L93 Difference]: Finished difference Result 1739 states and 3329 transitions.
[2024-10-29 15:23:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-29 15:23:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2024-10-29 15:23:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:45,977 INFO L225 Difference]: With dead ends: 1739
[2024-10-29 15:23:45,977 INFO L226 Difference]: Without dead ends: 1376
[2024-10-29 15:23:45,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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:23:45,978 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 58 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:45,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 272 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-29 15:23:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states.
[2024-10-29 15:23:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1350.
[2024-10-29 15:23:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1338 states have (on average 1.9103139013452914) internal successors, (2556), 1349 states have internal predecessors, (2556), 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:23:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2556 transitions.
[2024-10-29 15:23:45,994 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2556 transitions. Word has length 79
[2024-10-29 15:23:45,994 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2556 transitions.
[2024-10-29 15:23:45,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-29 15:23:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2556 transitions.
[2024-10-29 15:23:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2024-10-29 15:23:45,996 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:45,996 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]
[2024-10-29 15:23:46,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-10-29 15:23:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:46,200 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1268617950, now seen corresponding path program 1 times
[2024-10-29 15:23:46,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:46,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117656378]
[2024-10-29 15:23:46,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:46,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:46,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:46,203 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:46,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-10-29 15:23:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:46,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:46,280 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:46,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-10-29 15:23:46,301 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-10-29 15:23:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13
[2024-10-29 15:23:46,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2024-10-29 15:23:46,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2024-10-29 15:23:46,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2024-10-29 15:23:46,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:46,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2024-10-29 15:23:46,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 53
[2024-10-29 15:23:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:46,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:46,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117656378]
[2024-10-29 15:23:46,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117656378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-29 15:23:46,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864750952]
[2024-10-29 15:23:46,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:46,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:23:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:46,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:23:46,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:23:46,596 INFO L87 Difference]: Start difference. First operand 1350 states and 2556 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:23:47,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:47,413 INFO L93 Difference]: Finished difference Result 1350 states and 2556 transitions.
[2024-10-29 15:23:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:23:47,413 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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 84
[2024-10-29 15:23:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:47,419 INFO L225 Difference]: With dead ends: 1350
[2024-10-29 15:23:47,419 INFO L226 Difference]: Without dead ends: 1316
[2024-10-29 15:23:47,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342
[2024-10-29 15:23:47,420 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 277 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:47,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1206 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-10-29 15:23:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states.
[2024-10-29 15:23:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1270.
[2024-10-29 15:23:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1262 states have (on average 1.9072900158478605) internal successors, (2407), 1269 states have internal predecessors, (2407), 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:23:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 2407 transitions.
[2024-10-29 15:23:47,441 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 2407 transitions. Word has length 84
[2024-10-29 15:23:47,441 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:47,441 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 2407 transitions.
[2024-10-29 15:23:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:23:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 2407 transitions.
[2024-10-29 15:23:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2024-10-29 15:23:47,443 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:47,443 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]
[2024-10-29 15:23:47,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2024-10-29 15:23:47,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:47,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1153375779, now seen corresponding path program 1 times
[2024-10-29 15:23:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:47,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500837786]
[2024-10-29 15:23:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:47,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:47,655 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:47,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-10-29 15:23:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-29 15:23:47,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-10-29 15:23:47,729 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-29 15:23:47,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7
[2024-10-29 15:23:47,751 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size
[2024-10-29 15:23:47,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13
[2024-10-29 15:23:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-10-29 15:23:47,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15
[2024-10-29 15:23:47,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2024-10-29 15:23:47,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:47,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2024-10-29 15:23:47,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-10-29 15:23:47,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2024-10-29 15:23:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-10-29 15:23:47,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-29 15:23:47,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-29 15:23:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500837786]
[2024-10-29 15:23:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500837786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-29 15:23:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-29 15:23:47,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2024-10-29 15:23:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025047041]
[2024-10-29 15:23:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-29 15:23:47,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-29 15:23:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-29 15:23:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-29 15:23:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-10-29 15:23:47,992 INFO L87 Difference]: Start difference. First operand 1270 states and 2407 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:23:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-29 15:23:48,408 INFO L93 Difference]: Finished difference Result 1270 states and 2407 transitions.
[2024-10-29 15:23:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-29 15:23:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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 84
[2024-10-29 15:23:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-29 15:23:48,414 INFO L225 Difference]: With dead ends: 1270
[2024-10-29 15:23:48,414 INFO L226 Difference]: Without dead ends: 1091
[2024-10-29 15:23:48,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342
[2024-10-29 15:23:48,415 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 187 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-29 15:23:48,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1003 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-29 15:23:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states.
[2024-10-29 15:23:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091.
[2024-10-29 15:23:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1084 states have (on average 1.9142066420664208) internal successors, (2075), 1090 states have internal predecessors, (2075), 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:23:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2075 transitions.
[2024-10-29 15:23:48,429 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2075 transitions. Word has length 84
[2024-10-29 15:23:48,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-29 15:23:48,430 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 2075 transitions.
[2024-10-29 15:23:48,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 11 states have internal predecessors, (84), 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:23:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2075 transitions.
[2024-10-29 15:23:48,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2024-10-29 15:23:48,431 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-29 15:23:48,431 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-10-29 15:23:48,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-10-29 15:23:48,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:48,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] ===
[2024-10-29 15:23:48,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-29 15:23:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash -800020809, now seen corresponding path program 1 times
[2024-10-29 15:23:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-29 15:23:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641278599]
[2024-10-29 15:23:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-29 15:23:48,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:48,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-29 15:23:48,636 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-10-29 15:23:48,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-10-29 15:23:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:23:48,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-29 15:23:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-29 15:23:48,770 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-10-29 15:23:48,771 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-29 15:23:48,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining)
[2024-10-29 15:23:48,777 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining)
[2024-10-29 15:23:48,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining)
[2024-10-29 15:23:48,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining)
[2024-10-29 15:23:48,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining)
[2024-10-29 15:23:48,778 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining)
[2024-10-29 15:23:48,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2024-10-29 15:23:48,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-10-29 15:23:48,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-29 15:23:49,029 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-29 15:23:49,030 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-29 15:23:49,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:23:49 BasicIcfg
[2024-10-29 15:23:49,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-29 15:23:49,032 INFO L158 Benchmark]: Toolchain (without parser) took 9985.98ms. Allocated memory was 69.2MB in the beginning and 180.4MB in the end (delta: 111.1MB). Free memory was 42.0MB in the beginning and 69.7MB in the end (delta: -27.7MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,032 INFO L158 Benchmark]: Witness Parser took 0.22ms. Allocated memory is still 69.2MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:23:49,032 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 69.2MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-29 15:23:49,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.45ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 41.8MB in the beginning and 64.3MB in the end (delta: -22.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,033 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,033 INFO L158 Benchmark]: RCFGBuilder took 539.64ms. Allocated memory is still 104.9MB. Free memory was 59.0MB in the beginning and 76.1MB in the end (delta: -17.1MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,033 INFO L158 Benchmark]: TraceAbstraction took 8817.67ms. Allocated memory was 104.9MB in the beginning and 180.4MB in the end (delta: 75.5MB). Free memory was 75.6MB in the beginning and 69.7MB in the end (delta: 5.9MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
[2024-10-29 15:23:49,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Witness Parser took 0.22ms. Allocated memory is still 69.2MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CDTParser took 0.09ms. Allocated memory is still 69.2MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 524.45ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 41.8MB in the beginning and 64.3MB in the end (delta: -22.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 56.21ms. Allocated memory is still 104.9MB. Free memory was 63.8MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 42.98ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 539.64ms. Allocated memory is still 104.9MB. Free memory was 59.0MB in the beginning and 76.1MB in the end (delta: -17.1MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 8817.67ms. Allocated memory was 104.9MB in the beginning and 180.4MB in the end (delta: 75.5MB). Free memory was 75.6MB in the beginning and 69.7MB in the end (delta: 5.9MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
* 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
- DataRaceFoundResult [Line: 1058]: Data race detected
Data race detected
The following path leads to a data race:
[L1043] 0 int threads_mask = -1;
VAL [threads_mask=-1]
[L1044] 0 int *datas;
VAL [datas={0:0}, threads_mask=-1]
[L1052] 0 int threads_total = __VERIFIER_nondet_int();
VAL [datas={0:0}, threads_mask=-1, threads_total=16]
[L1053] CALL 0 assume_abort_if_not(threads_total >= 0)
[L1040] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1]
[L1053] RET 0 assume_abort_if_not(threads_total >= 0)
[L1054] CALL 0 assume_abort_if_not(threads_total < 32)
[L1040] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1]
[L1054] RET 0 assume_abort_if_not(threads_total < 32)
[L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
VAL [datas={0:0}, threads_mask=-1, threads_total=16, tids={1:0}]
[L1056] 0 datas = malloc(threads_total * sizeof(int))
VAL [datas={2:0}, threads_mask=-1, threads_total=16, tids={1:0}]
[L1057] 0 int i = 0;
VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}]
[L1057] COND TRUE 0 i < threads_total
VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}]
[L1058] EXPR 0 ffs(threads_mask)
VAL [datas={2:0}, i=0, threads_mask=-1, threads_total=16, tids={1:0}]
[L1058] 0 int j = ffs(threads_mask) - 1;
VAL [datas={2:0}, i=0, j=0, threads_mask=-1, threads_total=16, tids={1:0}]
[L1059] 0 threads_mask &= ~(1 << j)
VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}]
[L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
VAL [datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}]
[L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
VAL [\old(arg)={0:0}, datas={2:0}, i=0, j=0, threads_mask=-2, threads_total=16, tids={1:0}]
[L1046] 1 int j = (int)arg;
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2]
[L1057] 0 i++
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}]
[L1047] EXPR 1 datas[j]
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2]
[L1057] COND TRUE 0 i < threads_total
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-2, threads_total=16, tids={1:0}]
[L1047] EXPR 1 datas[j]
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2]
[L1047] 1 datas[j] = __VERIFIER_nondet_int()
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-2]
[L1048] 1 threads_mask |= 1 << j
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, j=0, threads_mask=-1]
[L1058] 0 ffs(threads_mask)
VAL [\old(arg)={0:0}, arg={0:0}, datas={2:0}, i=1, j=0, threads_mask=-1, threads_total=16, tids={1:0}]
Now there is a data race on ~threads_mask~0 between
C: threads_mask |= 1 << j [1048]
and
C: ffs(threads_mask) [1058]
- UnprovableResult [Line: 1056]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1066]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1059]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1063]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1059]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1060]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1060]: 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: 1047]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1047]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1048]: Unable to prove that there are no data races
Unable to prove that there are no data races
Reason: Not analyzed.
- UnprovableResult [Line: 1048]: 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, 157 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1429 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1429 mSDsluCounter, 6081 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4030 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 2051 mSDtfsCounter, 1456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 707 GetRequests, 639 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1795occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 286 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 2183 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 3/3 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:23:49,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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