./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-5-racy.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-5-racy.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/fib_unsafe-5-racy.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-5-racy.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:19:01,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:19:02,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:19:02,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:19:02,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:19:02,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:19:02,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:19:02,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:19:02,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:19:02,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:19:02,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:19:02,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:19:02,105 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:19:02,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:19:02,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:19:02,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:19:02,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:19:02,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:19:02,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:19:02,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:19:02,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:19:02,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:19:02,115 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:19:02,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:19:02,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:19:02,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:19:02,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:19:02,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:19:02,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:19:02,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:19:02,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:19:02,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:19:02,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:19:02,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:19:02,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:19:02,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:19:02,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:19:02,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:19:02,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:19:02,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:19:02,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:19:02,121 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-10-29 15:19:02,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:19:02,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:19:02,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:19:02,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:19:02,421 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:19:02,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5-racy.i [2024-10-29 15:19:03,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:19:04,042 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:19:04,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5-racy.i [2024-10-29 15:19:04,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ebeb420/7340c44f760d451e92b22e1e154ff298/FLAG21211c821 [2024-10-29 15:19:04,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6ebeb420/7340c44f760d451e92b22e1e154ff298 [2024-10-29 15:19:04,074 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:19:04,075 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:19:04,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/fib_unsafe-5-racy.yml/witness.graphml [2024-10-29 15:19:04,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:19:04,163 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:19:04,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:19:04,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:19:04,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:19:04,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:19:04" (1/2) ... [2024-10-29 15:19:04,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75df7780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:19:04" (1/2) ... [2024-10-29 15:19:04,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f2703b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:04" (2/2) ... [2024-10-29 15:19:04,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75df7780 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04, skipping insertion in model container [2024-10-29 15:19:04,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:04" (2/2) ... [2024-10-29 15:19:04,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:19:04,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:19:04,579 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:19:04,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:19:04,674 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:19:04,675 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04 WrapperNode [2024-10-29 15:19:04,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:19:04,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:19:04,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:19:04,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:19:04,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,730 INFO L138 Inliner]: procedures = 163, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2024-10-29 15:19:04,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:19:04,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:19:04,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:19:04,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:19:04,742 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:19:04,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:19:04,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:19:04,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:19:04,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (1/1) ... [2024-10-29 15:19:04,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:19:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:04,808 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:19:04,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-29 15:19:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-29 15:19:04,864 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-29 15:19:04,864 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-29 15:19:04,864 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-29 15:19:04,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-29 15:19:04,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:19:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:19:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-29 15:19:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:19:04,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:19:04,869 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:19:04,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:19:05,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:19:05,258 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:19:05,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:19:05,333 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:19:05,333 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-29 15:19:05,334 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:19:05 BoogieIcfgContainer [2024-10-29 15:19:05,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:19:05,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:19:05,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:19:05,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:19:05,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:19:04" (1/4) ... [2024-10-29 15:19:05,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f9bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:19:05, skipping insertion in model container [2024-10-29 15:19:05,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:19:04" (2/4) ... [2024-10-29 15:19:05,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f9bde and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:19:05, skipping insertion in model container [2024-10-29 15:19:05,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:19:04" (3/4) ... [2024-10-29 15:19:05,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f9bde and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:19:05, skipping insertion in model container [2024-10-29 15:19:05,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:19:05" (4/4) ... [2024-10-29 15:19:05,347 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5-racy.i [2024-10-29 15:19:05,347 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:19:05,371 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:19:05,371 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-29 15:19:05,372 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:19:05,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:19:05,451 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:19:05,463 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186 places, 188 transitions, 384 flow [2024-10-29 15:19:08,071 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 0 states have call successors, (0), 0 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:19:08,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:19:08,118 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;@57808abb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:19:08,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-10-29 15:19:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 0 states have call successors, (0), 0 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:19:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-29 15:19:08,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:08,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] [2024-10-29 15:19:08,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:08,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash 959234546, now seen corresponding path program 1 times [2024-10-29 15:19:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974659759] [2024-10-29 15:19:08,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:08,693 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:19:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974659759] [2024-10-29 15:19:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974659759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 15:19:08,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342145692] [2024-10-29 15:19:08,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:08,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 15:19:08,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 15:19:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 15:19:08,863 INFO L87 Difference]: Start difference. First operand has 73235 states, 72274 states have (on average 3.1515067659185876) internal successors, (227772), 73234 states have internal predecessors, (227772), 0 states have call successors, (0), 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 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:19:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:10,456 INFO L93 Difference]: Finished difference Result 101501 states and 319117 transitions. [2024-10-29 15:19:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 15:19:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-29 15:19:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:11,256 INFO L225 Difference]: With dead ends: 101501 [2024-10-29 15:19:11,256 INFO L226 Difference]: Without dead ends: 57526 [2024-10-29 15:19:11,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 15:19:11,379 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:11,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57526 states. [2024-10-29 15:19:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57526 to 57526. [2024-10-29 15:19:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57526 states, 57128 states have (on average 3.028900014003641) internal successors, (173035), 57525 states have internal predecessors, (173035), 0 states have call successors, (0), 0 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:19:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57526 states to 57526 states and 173035 transitions. [2024-10-29 15:19:14,315 INFO L78 Accepts]: Start accepts. Automaton has 57526 states and 173035 transitions. Word has length 22 [2024-10-29 15:19:14,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:14,316 INFO L471 AbstractCegarLoop]: Abstraction has 57526 states and 173035 transitions. [2024-10-29 15:19:14,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 22.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:19:14,317 INFO L276 IsEmpty]: Start isEmpty. Operand 57526 states and 173035 transitions. [2024-10-29 15:19:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-29 15:19:14,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:14,319 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] [2024-10-29 15:19:14,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:19:14,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -529477545, now seen corresponding path program 1 times [2024-10-29 15:19:14,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:14,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028666339] [2024-10-29 15:19:14,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:14,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:14,418 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:19:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028666339] [2024-10-29 15:19:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028666339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:14,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659682737] [2024-10-29 15:19:14,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:14,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:14,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:14,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:14,423 INFO L87 Difference]: Start difference. First operand 57526 states and 173035 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:19:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:15,190 INFO L93 Difference]: Finished difference Result 57526 states and 173035 transitions. [2024-10-29 15:19:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-10-29 15:19:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:15,579 INFO L225 Difference]: With dead ends: 57526 [2024-10-29 15:19:15,580 INFO L226 Difference]: Without dead ends: 55310 [2024-10-29 15:19:15,625 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:19:15,626 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 119 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:15,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 430 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55310 states. [2024-10-29 15:19:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55310 to 55310. [2024-10-29 15:19:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55310 states, 54992 states have (on average 3.0252945883037534) internal successors, (166367), 55309 states have internal predecessors, (166367), 0 states have call successors, (0), 0 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:19:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55310 states to 55310 states and 166367 transitions. [2024-10-29 15:19:17,599 INFO L78 Accepts]: Start accepts. Automaton has 55310 states and 166367 transitions. Word has length 32 [2024-10-29 15:19:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:17,600 INFO L471 AbstractCegarLoop]: Abstraction has 55310 states and 166367 transitions. [2024-10-29 15:19:17,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:19:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 55310 states and 166367 transitions. [2024-10-29 15:19:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-29 15:19:17,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:17,601 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] [2024-10-29 15:19:17,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:19:17,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:17,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1749844589, now seen corresponding path program 1 times [2024-10-29 15:19:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:17,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700872888] [2024-10-29 15:19:17,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:17,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700872888] [2024-10-29 15:19:17,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700872888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:17,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:17,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:17,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042228734] [2024-10-29 15:19:17,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:17,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:17,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:17,680 INFO L87 Difference]: Start difference. First operand 55310 states and 166367 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:19:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:18,451 INFO L93 Difference]: Finished difference Result 55310 states and 166367 transitions. [2024-10-29 15:19:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-29 15:19:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:18,737 INFO L225 Difference]: With dead ends: 55310 [2024-10-29 15:19:18,737 INFO L226 Difference]: Without dead ends: 50878 [2024-10-29 15:19:18,772 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:19:18,773 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 128 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:18,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 422 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50878 states. [2024-10-29 15:19:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50878 to 50878. [2024-10-29 15:19:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50878 states, 50720 states have (on average 3.0171727129337538) internal successors, (153031), 50877 states have internal predecessors, (153031), 0 states have call successors, (0), 0 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:19:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50878 states to 50878 states and 153031 transitions. [2024-10-29 15:19:20,521 INFO L78 Accepts]: Start accepts. Automaton has 50878 states and 153031 transitions. Word has length 35 [2024-10-29 15:19:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:20,522 INFO L471 AbstractCegarLoop]: Abstraction has 50878 states and 153031 transitions. [2024-10-29 15:19:20,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:19:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 50878 states and 153031 transitions. [2024-10-29 15:19:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-29 15:19:20,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:20,524 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] [2024-10-29 15:19:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:19:20,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash -934832415, now seen corresponding path program 1 times [2024-10-29 15:19:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746716156] [2024-10-29 15:19:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:20,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:20,578 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:19:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746716156] [2024-10-29 15:19:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746716156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674931103] [2024-10-29 15:19:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:20,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:20,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:20,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:20,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:20,580 INFO L87 Difference]: Start difference. First operand 50878 states and 153031 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:19:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:21,408 INFO L93 Difference]: Finished difference Result 50878 states and 153031 transitions. [2024-10-29 15:19:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:21,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2024-10-29 15:19:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:21,726 INFO L225 Difference]: With dead ends: 50878 [2024-10-29 15:19:21,726 INFO L226 Difference]: Without dead ends: 48923 [2024-10-29 15:19:21,768 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:19:21,769 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 110 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:21,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 416 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48923 states. [2024-10-29 15:19:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48923 to 48923. [2024-10-29 15:19:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48923 states, 48797 states have (on average 3.015410783449802) internal successors, (147143), 48922 states have internal predecessors, (147143), 0 states have call successors, (0), 0 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:19:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48923 states to 48923 states and 147143 transitions. [2024-10-29 15:19:23,292 INFO L78 Accepts]: Start accepts. Automaton has 48923 states and 147143 transitions. Word has length 38 [2024-10-29 15:19:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:23,293 INFO L471 AbstractCegarLoop]: Abstraction has 48923 states and 147143 transitions. [2024-10-29 15:19:23,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 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:19:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 48923 states and 147143 transitions. [2024-10-29 15:19:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:19:23,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:23,296 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:19:23,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:19:23,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:23,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1890395950, now seen corresponding path program 1 times [2024-10-29 15:19:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079499569] [2024-10-29 15:19:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:23,375 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:19:23,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:23,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079499569] [2024-10-29 15:19:23,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079499569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:23,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:23,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:23,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937511668] [2024-10-29 15:19:23,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:23,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:23,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:23,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:23,377 INFO L87 Difference]: Start difference. First operand 48923 states and 147143 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:19:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:23,632 INFO L93 Difference]: Finished difference Result 48923 states and 147143 transitions. [2024-10-29 15:19:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:23,633 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:19:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:23,892 INFO L225 Difference]: With dead ends: 48923 [2024-10-29 15:19:23,893 INFO L226 Difference]: Without dead ends: 48348 [2024-10-29 15:19:23,928 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:19:23,929 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 49 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:23,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 350 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48348 states. [2024-10-29 15:19:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48348 to 48348. [2024-10-29 15:19:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48348 states, 48230 states have (on average 3.0150943396226415) internal successors, (145418), 48347 states have internal predecessors, (145418), 0 states have call successors, (0), 0 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:19:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48348 states to 48348 states and 145418 transitions. [2024-10-29 15:19:26,164 INFO L78 Accepts]: Start accepts. Automaton has 48348 states and 145418 transitions. Word has length 41 [2024-10-29 15:19:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:26,165 INFO L471 AbstractCegarLoop]: Abstraction has 48348 states and 145418 transitions. [2024-10-29 15:19:26,165 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:19:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 48348 states and 145418 transitions. [2024-10-29 15:19:26,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-29 15:19:26,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:26,167 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:19:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:19:26,167 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:26,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1023988735, now seen corresponding path program 1 times [2024-10-29 15:19:26,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:26,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606078961] [2024-10-29 15:19:26,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:26,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:26,220 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:19:26,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:26,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606078961] [2024-10-29 15:19:26,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606078961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356133484] [2024-10-29 15:19:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:26,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:26,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:26,225 INFO L87 Difference]: Start difference. First operand 48348 states and 145418 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:19:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:26,566 INFO L93 Difference]: Finished difference Result 48348 states and 145418 transitions. [2024-10-29 15:19:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:26,567 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:19:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:26,857 INFO L225 Difference]: With dead ends: 48348 [2024-10-29 15:19:26,857 INFO L226 Difference]: Without dead ends: 44484 [2024-10-29 15:19:26,886 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:19:26,887 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 118 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:26,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 405 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:26,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44484 states. [2024-10-29 15:19:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44484 to 44484. [2024-10-29 15:19:28,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44484 states, 44426 states have (on average 3.011299689371089) internal successors, (133780), 44483 states have internal predecessors, (133780), 0 states have call successors, (0), 0 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:19:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44484 states to 44484 states and 133780 transitions. [2024-10-29 15:19:28,546 INFO L78 Accepts]: Start accepts. Automaton has 44484 states and 133780 transitions. Word has length 41 [2024-10-29 15:19:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:28,546 INFO L471 AbstractCegarLoop]: Abstraction has 44484 states and 133780 transitions. [2024-10-29 15:19:28,547 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:19:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 44484 states and 133780 transitions. [2024-10-29 15:19:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:19:28,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:28,549 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] [2024-10-29 15:19:28,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:19:28,549 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:28,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:28,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1174888269, now seen corresponding path program 1 times [2024-10-29 15:19:28,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:28,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985987027] [2024-10-29 15:19:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:28,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:28,592 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:19:28,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:28,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985987027] [2024-10-29 15:19:28,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985987027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:28,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:28,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:28,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435673332] [2024-10-29 15:19:28,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:28,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:28,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:28,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:28,594 INFO L87 Difference]: Start difference. First operand 44484 states and 133780 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:19:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:28,824 INFO L93 Difference]: Finished difference Result 44484 states and 133780 transitions. [2024-10-29 15:19:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-29 15:19:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:29,021 INFO L225 Difference]: With dead ends: 44484 [2024-10-29 15:19:29,021 INFO L226 Difference]: Without dead ends: 43426 [2024-10-29 15:19:29,040 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:19:29,041 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 113 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:29,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 280 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:29,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43426 states. [2024-10-29 15:19:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43426 to 43426. [2024-10-29 15:19:30,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43426 states, 43376 states have (on average 3.0110199188491333) internal successors, (130606), 43425 states have internal predecessors, (130606), 0 states have call successors, (0), 0 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:19:30,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43426 states to 43426 states and 130606 transitions. [2024-10-29 15:19:30,566 INFO L78 Accepts]: Start accepts. Automaton has 43426 states and 130606 transitions. Word has length 44 [2024-10-29 15:19:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:30,567 INFO L471 AbstractCegarLoop]: Abstraction has 43426 states and 130606 transitions. [2024-10-29 15:19:30,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:19:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43426 states and 130606 transitions. [2024-10-29 15:19:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:19:30,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:30,569 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] [2024-10-29 15:19:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:19:30,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1742870495, now seen corresponding path program 1 times [2024-10-29 15:19:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949045643] [2024-10-29 15:19:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:30,623 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:19:30,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:30,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949045643] [2024-10-29 15:19:30,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949045643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:30,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:30,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:30,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345643967] [2024-10-29 15:19:30,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:30,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:30,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:30,626 INFO L87 Difference]: Start difference. First operand 43426 states and 130606 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:19:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:30,846 INFO L93 Difference]: Finished difference Result 43426 states and 130606 transitions. [2024-10-29 15:19:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:30,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-10-29 15:19:30,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:31,043 INFO L225 Difference]: With dead ends: 43426 [2024-10-29 15:19:31,044 INFO L226 Difference]: Without dead ends: 40793 [2024-10-29 15:19:31,067 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:19:31,067 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 114 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:31,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 408 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40793 states. [2024-10-29 15:19:32,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40793 to 40793. [2024-10-29 15:19:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40793 states, 40769 states have (on average 3.0079962716770097) internal successors, (122633), 40792 states have internal predecessors, (122633), 0 states have call successors, (0), 0 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:19:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40793 states to 40793 states and 122633 transitions. [2024-10-29 15:19:32,553 INFO L78 Accepts]: Start accepts. Automaton has 40793 states and 122633 transitions. Word has length 44 [2024-10-29 15:19:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:32,554 INFO L471 AbstractCegarLoop]: Abstraction has 40793 states and 122633 transitions. [2024-10-29 15:19:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:19:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 40793 states and 122633 transitions. [2024-10-29 15:19:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-29 15:19:32,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:32,557 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] [2024-10-29 15:19:32,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:19:32,557 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:32,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1408284112, now seen corresponding path program 1 times [2024-10-29 15:19:32,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:32,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246940833] [2024-10-29 15:19:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:32,635 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:19:32,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:32,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246940833] [2024-10-29 15:19:32,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246940833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:32,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:32,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-29 15:19:32,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128438979] [2024-10-29 15:19:32,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:32,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:32,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:32,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:32,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:32,638 INFO L87 Difference]: Start difference. First operand 40793 states and 122633 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:19:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:32,995 INFO L93 Difference]: Finished difference Result 73837 states and 222205 transitions. [2024-10-29 15:19:32,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-29 15:19:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:33,938 INFO L225 Difference]: With dead ends: 73837 [2024-10-29 15:19:33,938 INFO L226 Difference]: Without dead ends: 59515 [2024-10-29 15:19:33,972 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:19:33,973 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 101 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:33,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 280 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:34,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59515 states. [2024-10-29 15:19:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59515 to 42311. [2024-10-29 15:19:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42311 states, 42287 states have (on average 3.0077092250573463) internal successors, (127187), 42310 states have internal predecessors, (127187), 0 states have call successors, (0), 0 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:19:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42311 states to 42311 states and 127187 transitions. [2024-10-29 15:19:35,464 INFO L78 Accepts]: Start accepts. Automaton has 42311 states and 127187 transitions. Word has length 47 [2024-10-29 15:19:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:35,465 INFO L471 AbstractCegarLoop]: Abstraction has 42311 states and 127187 transitions. [2024-10-29 15:19:35,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:19:35,465 INFO L276 IsEmpty]: Start isEmpty. Operand 42311 states and 127187 transitions. [2024-10-29 15:19:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-29 15:19:35,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:35,469 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] [2024-10-29 15:19:35,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:19:35,470 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:35,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:35,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1408283567, now seen corresponding path program 1 times [2024-10-29 15:19:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:35,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724985715] [2024-10-29 15:19:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:35,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:35,504 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:19:35,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:35,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724985715] [2024-10-29 15:19:35,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724985715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:35,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:35,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:35,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109779365] [2024-10-29 15:19:35,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:35,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:35,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:35,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:35,507 INFO L87 Difference]: Start difference. First operand 42311 states and 127187 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:19:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:36,346 INFO L93 Difference]: Finished difference Result 42311 states and 127187 transitions. [2024-10-29 15:19:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-29 15:19:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:36,539 INFO L225 Difference]: With dead ends: 42311 [2024-10-29 15:19:36,539 INFO L226 Difference]: Without dead ends: 41299 [2024-10-29 15:19:36,559 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:19:36,560 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 88 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:36,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 299 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41299 states. [2024-10-29 15:19:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41299 to 41299. [2024-10-29 15:19:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41299 states, 41279 states have (on average 3.007606773419899) internal successors, (124151), 41298 states have internal predecessors, (124151), 0 states have call successors, (0), 0 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:19:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41299 states to 41299 states and 124151 transitions. [2024-10-29 15:19:37,451 INFO L78 Accepts]: Start accepts. Automaton has 41299 states and 124151 transitions. Word has length 47 [2024-10-29 15:19:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:37,452 INFO L471 AbstractCegarLoop]: Abstraction has 41299 states and 124151 transitions. [2024-10-29 15:19:37,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 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:19:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 41299 states and 124151 transitions. [2024-10-29 15:19:37,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:19:37,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:37,456 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] [2024-10-29 15:19:37,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:19:37,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:37,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:37,456 INFO L85 PathProgramCache]: Analyzing trace with hash 445824893, now seen corresponding path program 1 times [2024-10-29 15:19:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627107166] [2024-10-29 15:19:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:37,485 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:19:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:37,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627107166] [2024-10-29 15:19:37,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627107166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:37,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:37,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323800319] [2024-10-29 15:19:37,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:37,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:37,490 INFO L87 Difference]: Start difference. First operand 41299 states and 124151 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:19:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:38,079 INFO L93 Difference]: Finished difference Result 41299 states and 124151 transitions. [2024-10-29 15:19:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-10-29 15:19:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:38,263 INFO L225 Difference]: With dead ends: 41299 [2024-10-29 15:19:38,263 INFO L226 Difference]: Without dead ends: 40287 [2024-10-29 15:19:38,284 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:19:38,285 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 64 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:38,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 319 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40287 states. [2024-10-29 15:19:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40287 to 40287. [2024-10-29 15:19:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40287 states, 40271 states have (on average 3.0074991929676442) internal successors, (121115), 40286 states have internal predecessors, (121115), 0 states have call successors, (0), 0 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:19:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40287 states to 40287 states and 121115 transitions. [2024-10-29 15:19:39,154 INFO L78 Accepts]: Start accepts. Automaton has 40287 states and 121115 transitions. Word has length 49 [2024-10-29 15:19:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:39,155 INFO L471 AbstractCegarLoop]: Abstraction has 40287 states and 121115 transitions. [2024-10-29 15:19:39,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 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:19:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40287 states and 121115 transitions. [2024-10-29 15:19:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-29 15:19:39,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:39,159 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] [2024-10-29 15:19:39,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:19:39,160 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1193293355, now seen corresponding path program 1 times [2024-10-29 15:19:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864634039] [2024-10-29 15:19:39,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:39,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:39,190 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:19:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:39,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864634039] [2024-10-29 15:19:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864634039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734723392] [2024-10-29 15:19:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:39,193 INFO L87 Difference]: Start difference. First operand 40287 states and 121115 transitions. Second operand has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:19:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:39,710 INFO L93 Difference]: Finished difference Result 40287 states and 121115 transitions. [2024-10-29 15:19:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-29 15:19:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:39,861 INFO L225 Difference]: With dead ends: 40287 [2024-10-29 15:19:39,861 INFO L226 Difference]: Without dead ends: 33071 [2024-10-29 15:19:39,891 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:19:39,892 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 103 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:39,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 388 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33071 states. [2024-10-29 15:19:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33071 to 33071. [2024-10-29 15:19:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33071 states, 33064 states have (on average 2.995009678199855) internal successors, (99027), 33070 states have internal predecessors, (99027), 0 states have call successors, (0), 0 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:19:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33071 states to 33071 states and 99027 transitions. [2024-10-29 15:19:40,622 INFO L78 Accepts]: Start accepts. Automaton has 33071 states and 99027 transitions. Word has length 50 [2024-10-29 15:19:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:40,623 INFO L471 AbstractCegarLoop]: Abstraction has 33071 states and 99027 transitions. [2024-10-29 15:19:40,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.0) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:19:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 33071 states and 99027 transitions. [2024-10-29 15:19:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-29 15:19:40,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:40,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:19:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:19:40,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash 215393162, now seen corresponding path program 1 times [2024-10-29 15:19:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177183522] [2024-10-29 15:19:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:40,659 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:19:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177183522] [2024-10-29 15:19:40,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177183522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:40,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:40,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:40,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263796957] [2024-10-29 15:19:40,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:40,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:40,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:40,662 INFO L87 Difference]: Start difference. First operand 33071 states and 99027 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:40,851 INFO L93 Difference]: Finished difference Result 33071 states and 99027 transitions. [2024-10-29 15:19:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-29 15:19:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:41,031 INFO L225 Difference]: With dead ends: 33071 [2024-10-29 15:19:41,031 INFO L226 Difference]: Without dead ends: 32587 [2024-10-29 15:19:41,046 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:19:41,046 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 45 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:41,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 302 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32587 states. [2024-10-29 15:19:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32587 to 32587. [2024-10-29 15:19:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32587 states, 32581 states have (on average 2.994843620515024) internal successors, (97575), 32586 states have internal predecessors, (97575), 0 states have call successors, (0), 0 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:19:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32587 states to 32587 states and 97575 transitions. [2024-10-29 15:19:42,246 INFO L78 Accepts]: Start accepts. Automaton has 32587 states and 97575 transitions. Word has length 53 [2024-10-29 15:19:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:42,247 INFO L471 AbstractCegarLoop]: Abstraction has 32587 states and 97575 transitions. [2024-10-29 15:19:42,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 32587 states and 97575 transitions. [2024-10-29 15:19:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-29 15:19:42,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:42,258 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] [2024-10-29 15:19:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:19:42,258 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:42,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:42,259 INFO L85 PathProgramCache]: Analyzing trace with hash -800692820, now seen corresponding path program 1 times [2024-10-29 15:19:42,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:42,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71007670] [2024-10-29 15:19:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:42,320 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:19:42,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:42,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71007670] [2024-10-29 15:19:42,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71007670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:42,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:42,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908879090] [2024-10-29 15:19:42,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:42,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:42,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:42,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:42,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:42,324 INFO L87 Difference]: Start difference. First operand 32587 states and 97575 transitions. Second operand has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:19:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:42,536 INFO L93 Difference]: Finished difference Result 32587 states and 97575 transitions. [2024-10-29 15:19:42,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-29 15:19:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:42,714 INFO L225 Difference]: With dead ends: 32587 [2024-10-29 15:19:42,714 INFO L226 Difference]: Without dead ends: 32103 [2024-10-29 15:19:42,729 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:19:42,730 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 45 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:42,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 299 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32103 states. [2024-10-29 15:19:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32103 to 32103. [2024-10-29 15:19:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32103 states, 32098 states have (on average 2.994672565268864) internal successors, (96123), 32102 states have internal predecessors, (96123), 0 states have call successors, (0), 0 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:19:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32103 states to 32103 states and 96123 transitions. [2024-10-29 15:19:43,748 INFO L78 Accepts]: Start accepts. Automaton has 32103 states and 96123 transitions. Word has length 60 [2024-10-29 15:19:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:43,748 INFO L471 AbstractCegarLoop]: Abstraction has 32103 states and 96123 transitions. [2024-10-29 15:19:43,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:19:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32103 states and 96123 transitions. [2024-10-29 15:19:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:19:43,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:43,761 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] [2024-10-29 15:19:43,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:19:43,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:43,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:43,761 INFO L85 PathProgramCache]: Analyzing trace with hash 809008106, now seen corresponding path program 1 times [2024-10-29 15:19:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309345198] [2024-10-29 15:19:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:43,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:43,793 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:19:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:43,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309345198] [2024-10-29 15:19:43,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309345198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:43,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:43,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:43,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440355716] [2024-10-29 15:19:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:43,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:43,796 INFO L87 Difference]: Start difference. First operand 32103 states and 96123 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:19:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:44,008 INFO L93 Difference]: Finished difference Result 35491 states and 106287 transitions. [2024-10-29 15:19:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-29 15:19:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:44,184 INFO L225 Difference]: With dead ends: 35491 [2024-10-29 15:19:44,184 INFO L226 Difference]: Without dead ends: 35007 [2024-10-29 15:19:44,200 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:19:44,201 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 86 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:44,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:44,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35007 states. [2024-10-29 15:19:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35007 to 31619. [2024-10-29 15:19:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31619 states, 31615 states have (on average 2.9944962834097737) internal successors, (94671), 31618 states have internal predecessors, (94671), 0 states have call successors, (0), 0 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:19:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 94671 transitions. [2024-10-29 15:19:45,413 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 94671 transitions. Word has length 63 [2024-10-29 15:19:45,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:45,414 INFO L471 AbstractCegarLoop]: Abstraction has 31619 states and 94671 transitions. [2024-10-29 15:19:45,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:19:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 94671 transitions. [2024-10-29 15:19:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-29 15:19:45,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:45,427 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] [2024-10-29 15:19:45,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:19:45,428 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:45,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:45,428 INFO L85 PathProgramCache]: Analyzing trace with hash 654170415, now seen corresponding path program 1 times [2024-10-29 15:19:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216742844] [2024-10-29 15:19:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:45,456 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:19:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216742844] [2024-10-29 15:19:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216742844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:45,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:45,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459326815] [2024-10-29 15:19:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:45,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:45,458 INFO L87 Difference]: Start difference. First operand 31619 states and 94671 transitions. Second operand has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:19:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:45,629 INFO L93 Difference]: Finished difference Result 31619 states and 94671 transitions. [2024-10-29 15:19:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2024-10-29 15:19:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:45,784 INFO L225 Difference]: With dead ends: 31619 [2024-10-29 15:19:45,784 INFO L226 Difference]: Without dead ends: 31135 [2024-10-29 15:19:45,799 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:19:45,799 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:45,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 295 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:45,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31135 states. [2024-10-29 15:19:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31135 to 31135. [2024-10-29 15:19:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31135 states, 31132 states have (on average 2.994314531671592) internal successors, (93219), 31134 states have internal predecessors, (93219), 0 states have call successors, (0), 0 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:19:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31135 states to 31135 states and 93219 transitions. [2024-10-29 15:19:46,459 INFO L78 Accepts]: Start accepts. Automaton has 31135 states and 93219 transitions. Word has length 67 [2024-10-29 15:19:46,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:46,460 INFO L471 AbstractCegarLoop]: Abstraction has 31135 states and 93219 transitions. [2024-10-29 15:19:46,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:19:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31135 states and 93219 transitions. [2024-10-29 15:19:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-29 15:19:46,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:46,482 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] [2024-10-29 15:19:46,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-29 15:19:46,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:46,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash 308719358, now seen corresponding path program 1 times [2024-10-29 15:19:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128288493] [2024-10-29 15:19:46,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:46,511 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:19:46,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128288493] [2024-10-29 15:19:46,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128288493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:46,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:19:46,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:19:46,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62659167] [2024-10-29 15:19:46,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:46,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:46,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:46,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:19:46,513 INFO L87 Difference]: Start difference. First operand 31135 states and 93219 transitions. Second operand has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:19:47,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:47,173 INFO L93 Difference]: Finished difference Result 31135 states and 93219 transitions. [2024-10-29 15:19:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-10-29 15:19:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:47,355 INFO L225 Difference]: With dead ends: 31135 [2024-10-29 15:19:47,355 INFO L226 Difference]: Without dead ends: 30651 [2024-10-29 15:19:47,363 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:19:47,363 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:47,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 290 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30651 states. [2024-10-29 15:19:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30651 to 30651. [2024-10-29 15:19:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30651 states, 30649 states have (on average 2.994127051453555) internal successors, (91767), 30650 states have internal predecessors, (91767), 0 states have call successors, (0), 0 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:19:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30651 states to 30651 states and 91767 transitions. [2024-10-29 15:19:47,974 INFO L78 Accepts]: Start accepts. Automaton has 30651 states and 91767 transitions. Word has length 75 [2024-10-29 15:19:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:47,974 INFO L471 AbstractCegarLoop]: Abstraction has 30651 states and 91767 transitions. [2024-10-29 15:19:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:19:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30651 states and 91767 transitions. [2024-10-29 15:19:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-29 15:19:48,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:48,009 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] [2024-10-29 15:19:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-29 15:19:48,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:48,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2042320711, now seen corresponding path program 1 times [2024-10-29 15:19:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289281925] [2024-10-29 15:19:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289281925] [2024-10-29 15:19:48,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289281925] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:19:48,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706436173] [2024-10-29 15:19:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:48,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:19:48,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:48,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:19:48,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-29 15:19:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:48,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-29 15:19:48,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:19:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-29 15:19:48,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-29 15:19:48,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706436173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-29 15:19:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-29 15:19:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061039807] [2024-10-29 15:19:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:48,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:48,250 INFO L87 Difference]: Start difference. First operand 30651 states and 91767 transitions. Second operand has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:19:48,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:48,482 INFO L93 Difference]: Finished difference Result 50059 states and 149681 transitions. [2024-10-29 15:19:48,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:48,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 90 [2024-10-29 15:19:48,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:48,689 INFO L225 Difference]: With dead ends: 50059 [2024-10-29 15:19:48,690 INFO L226 Difference]: Without dead ends: 49575 [2024-10-29 15:19:48,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:48,713 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 100 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:48,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 345 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49575 states. [2024-10-29 15:19:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49575 to 30871. [2024-10-29 15:19:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30871 states, 30869 states have (on average 2.9941689073180213) internal successors, (92427), 30870 states have internal predecessors, (92427), 0 states have call successors, (0), 0 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:19:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30871 states to 30871 states and 92427 transitions. [2024-10-29 15:19:50,310 INFO L78 Accepts]: Start accepts. Automaton has 30871 states and 92427 transitions. Word has length 90 [2024-10-29 15:19:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:50,311 INFO L471 AbstractCegarLoop]: Abstraction has 30871 states and 92427 transitions. [2024-10-29 15:19:50,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 44.0) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 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:19:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30871 states and 92427 transitions. [2024-10-29 15:19:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-29 15:19:50,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:50,343 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] [2024-10-29 15:19:50,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-29 15:19:50,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-29 15:19:50,548 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -222269459, now seen corresponding path program 1 times [2024-10-29 15:19:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749619898] [2024-10-29 15:19:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:50,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749619898] [2024-10-29 15:19:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749619898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:19:50,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008319721] [2024-10-29 15:19:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:50,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:19:50,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:50,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:19:50,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-29 15:19:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:50,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-29 15:19:50,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:19:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-29 15:19:50,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-29 15:19:50,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008319721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:19:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-29 15:19:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-29 15:19:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115433587] [2024-10-29 15:19:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:19:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:19:50,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:19:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:50,749 INFO L87 Difference]: Start difference. First operand 30871 states and 92427 transitions. Second operand has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 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:19:50,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:50,994 INFO L93 Difference]: Finished difference Result 50009 states and 149233 transitions. [2024-10-29 15:19:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:19:50,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 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 94 [2024-10-29 15:19:50,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:51,191 INFO L225 Difference]: With dead ends: 50009 [2024-10-29 15:19:51,191 INFO L226 Difference]: Without dead ends: 48091 [2024-10-29 15:19:51,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:19:51,215 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 106 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:51,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 355 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:19:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48091 states. [2024-10-29 15:19:52,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48091 to 30314. [2024-10-29 15:19:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30314 states, 30312 states have (on average 2.9807666930588548) internal successors, (90353), 30313 states have internal predecessors, (90353), 0 states have call successors, (0), 0 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:19:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30314 states to 30314 states and 90353 transitions. [2024-10-29 15:19:52,406 INFO L78 Accepts]: Start accepts. Automaton has 30314 states and 90353 transitions. Word has length 94 [2024-10-29 15:19:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:19:52,407 INFO L471 AbstractCegarLoop]: Abstraction has 30314 states and 90353 transitions. [2024-10-29 15:19:52,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 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:19:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 30314 states and 90353 transitions. [2024-10-29 15:19:52,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-29 15:19:52,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:19:52,448 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] [2024-10-29 15:19:52,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-29 15:19:52,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:19:52,649 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-29 15:19:52,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:19:52,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1300709665, now seen corresponding path program 1 times [2024-10-29 15:19:52,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:19:52,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466909900] [2024-10-29 15:19:52,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:52,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:19:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:52,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:19:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466909900] [2024-10-29 15:19:52,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466909900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:19:52,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203525030] [2024-10-29 15:19:52,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:19:52,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:19:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:19:52,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-29 15:19:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-29 15:19:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:19:52,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-29 15:19:52,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:19:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:52,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-29 15:19:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:19:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203525030] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-29 15:19:52,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-29 15:19:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-29 15:19:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572330939] [2024-10-29 15:19:52,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-29 15:19:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:19:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:19:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:19:52,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:19:52,999 INFO L87 Difference]: Start difference. First operand 30314 states and 90353 transitions. Second operand has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:19:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:19:53,464 INFO L93 Difference]: Finished difference Result 71394 states and 213665 transitions. [2024-10-29 15:19:53,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-29 15:19:53,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.8) internal successors, (178), 10 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-29 15:19:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:19:53,693 INFO L225 Difference]: With dead ends: 71394 [2024-10-29 15:19:53,693 INFO L226 Difference]: Without dead ends: 63564 [2024-10-29 15:19:53,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-10-29 15:19:53,732 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 885 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:19:53,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 611 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]