./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-1.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/nondet-array-1.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-nondet/nondet-array-1.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/nondet-array-1.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:21:45,271 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:21:45,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-29 15:21:45,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:21:45,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:21:45,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:21:45,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:21:45,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:21:45,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:21:45,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:21:45,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:21:45,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:21:45,375 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:21:45,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:21:45,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:21:45,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:21:45,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:21:45,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:21:45,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:21:45,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:21:45,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:21:45,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:21:45,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:21:45,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:21:45,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:21:45,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:21:45,385 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:21:45,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:21:45,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:21:45,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:21:45,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:21:45,580 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:21:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2024-10-29 15:21:46,935 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:21:47,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:21:47,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-1.i [2024-10-29 15:21:47,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea9ef10f/a7d2a77d483d42d1b2c1fd36779690ac/FLAG0b0382afa [2024-10-29 15:21:47,227 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea9ef10f/a7d2a77d483d42d1b2c1fd36779690ac [2024-10-29 15:21:47,233 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:21:47,235 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:21:47,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../results-verified/LOGDIR/SV-COMP24_no-data-race/nondet-array-1.yml/witness.graphml [2024-10-29 15:21:47,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:21:47,302 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:21:47,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:21:47,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:21:47,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:21:47,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:47" (1/2) ... [2024-10-29 15:21:47,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61014ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:47, skipping insertion in model container [2024-10-29 15:21:47,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:47" (1/2) ... [2024-10-29 15:21:47,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7e227868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:47, skipping insertion in model container [2024-10-29 15:21:47,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:47" (2/2) ... [2024-10-29 15:21:47,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61014ae5 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:47, skipping insertion in model container [2024-10-29 15:21:47,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:47" (2/2) ... [2024-10-29 15:21:47,347 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:21:47,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:21:47,662 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:21:47,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:21:47,744 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:21:47,745 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:47 WrapperNode [2024-10-29 15:21:47,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:21:47,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:21:47,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:21:47,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:21:47,751 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:21:47" (1/1) ... [2024-10-29 15:21:47,761 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:21:47" (1/1) ... [2024-10-29 15:21:47,786 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2024-10-29 15:21:47,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:21:47,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:21:47,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:21:47,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:21:47,797 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:21:47" (1/1) ... [2024-10-29 15:21:47,797 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:21:47" (1/1) ... [2024-10-29 15:21:47,800 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:21:47" (1/1) ... [2024-10-29 15:21:47,802 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:21:47" (1/1) ... [2024-10-29 15:21:47,816 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:21:47" (1/1) ... [2024-10-29 15:21:47,821 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:21:47" (1/1) ... [2024-10-29 15:21:47,823 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:21:47" (1/1) ... [2024-10-29 15:21:47,824 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:21:47" (1/1) ... [2024-10-29 15:21:47,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:21:47,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:21:47,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:21:47,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:21:47,832 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:21:47" (1/1) ... [2024-10-29 15:21:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:21:47,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:21:47,869 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:21:47,881 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:21:47,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 15:21:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 15:21:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2024-10-29 15:21:47,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2024-10-29 15:21:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:21:47,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-29 15:21:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-29 15:21:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:21:47,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:21:47,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:21:47,920 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:21:48,042 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:21:48,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:21:48,273 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:21:48,274 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:21:48,288 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:21:48,289 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-29 15:21:48,289 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:21:48 BoogieIcfgContainer [2024-10-29 15:21:48,289 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:21:48,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:21:48,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:21:48,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:21:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:21:47" (1/4) ... [2024-10-29 15:21:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640857cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:21:48, skipping insertion in model container [2024-10-29 15:21:48,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.graphml de.uni_freiburg.informatik.ultimate.witnessparser VIOLATION_WITNESS 29.10 03:21:47" (2/4) ... [2024-10-29 15:21:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640857cd and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:48, skipping insertion in model container [2024-10-29 15:21:48,295 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:21:47" (3/4) ... [2024-10-29 15:21:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640857cd and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:48, skipping insertion in model container [2024-10-29 15:21:48,296 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:21:48" (4/4) ... [2024-10-29 15:21:48,297 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-array-1.i [2024-10-29 15:21:48,297 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:21:48,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:21:48,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-29 15:21:48,316 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:21:48,362 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 15:21:48,384 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:21:48,396 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 132 transitions, 271 flow [2024-10-29 15:21:48,470 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1463 states, 1436 states have (on average 2.0201949860724233) internal successors, (2901), 1462 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:48,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:21:48,504 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;@704b9986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:21:48,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-29 15:21:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 1463 states, 1436 states have (on average 2.0201949860724233) internal successors, (2901), 1462 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:21:48,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:48,525 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:21:48,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:48,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1230436126, now seen corresponding path program 1 times [2024-10-29 15:21:48,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:48,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135067438] [2024-10-29 15:21:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:48,950 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:21:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:48,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135067438] [2024-10-29 15:21:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135067438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051768548] [2024-10-29 15:21:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:48,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:21:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:48,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:21:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:21:48,993 INFO L87 Difference]: Start difference. First operand has 1463 states, 1436 states have (on average 2.0201949860724233) internal successors, (2901), 1462 states have internal predecessors, (2901), 0 states have call successors, (0), 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 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:49,164 INFO L93 Difference]: Finished difference Result 2601 states and 5184 transitions. [2024-10-29 15:21:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-29 15:21:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:49,184 INFO L225 Difference]: With dead ends: 2601 [2024-10-29 15:21:49,184 INFO L226 Difference]: Without dead ends: 1104 [2024-10-29 15:21:49,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:21:49,193 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 152 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:49,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 254 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:21:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-10-29 15:21:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1092. [2024-10-29 15:21:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1068 states have (on average 1.9101123595505618) internal successors, (2040), 1091 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2040 transitions. [2024-10-29 15:21:49,276 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2040 transitions. Word has length 44 [2024-10-29 15:21:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 2040 transitions. [2024-10-29 15:21:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2040 transitions. [2024-10-29 15:21:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-29 15:21:49,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:49,278 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] [2024-10-29 15:21:49,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:21:49,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:49,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2093606866, now seen corresponding path program 1 times [2024-10-29 15:21:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:49,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781369755] [2024-10-29 15:21:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:49,742 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:21:49,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:49,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781369755] [2024-10-29 15:21:49,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781369755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:49,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:49,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260706423] [2024-10-29 15:21:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:49,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:21:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:49,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:21:49,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:49,746 INFO L87 Difference]: Start difference. First operand 1092 states and 2040 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:49,915 INFO L93 Difference]: Finished difference Result 1190 states and 2215 transitions. [2024-10-29 15:21:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:21:49,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-29 15:21:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:49,921 INFO L225 Difference]: With dead ends: 1190 [2024-10-29 15:21:49,922 INFO L226 Difference]: Without dead ends: 1167 [2024-10-29 15:21:49,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:49,923 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:49,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 436 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:21:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-10-29 15:21:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1139. [2024-10-29 15:21:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1117 states have (on average 1.9077887197851389) internal successors, (2131), 1138 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2131 transitions. [2024-10-29 15:21:49,959 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2131 transitions. Word has length 45 [2024-10-29 15:21:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:49,960 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 2131 transitions. [2024-10-29 15:21:49,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2131 transitions. [2024-10-29 15:21:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:21:49,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:49,962 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:21:49,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:21:49,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:49,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:49,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1301886202, now seen corresponding path program 1 times [2024-10-29 15:21:49,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:49,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100940377] [2024-10-29 15:21:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:50,012 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:21:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:50,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100940377] [2024-10-29 15:21:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100940377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190123101] [2024-10-29 15:21:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:50,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:50,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:50,016 INFO L87 Difference]: Start difference. First operand 1139 states and 2131 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:21:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:50,032 INFO L93 Difference]: Finished difference Result 1139 states and 2131 transitions. [2024-10-29 15:21:50,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:50,033 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:21:50,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:50,040 INFO L225 Difference]: With dead ends: 1139 [2024-10-29 15:21:50,040 INFO L226 Difference]: Without dead ends: 1091 [2024-10-29 15:21:50,041 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:21:50,043 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 61 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:50,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 269 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2024-10-29 15:21:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1091. [2024-10-29 15:21:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1074 states have (on average 1.8957169459962757) internal successors, (2036), 1090 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:50,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 2036 transitions. [2024-10-29 15:21:50,075 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 2036 transitions. Word has length 49 [2024-10-29 15:21:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:50,078 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 2036 transitions. [2024-10-29 15:21:50,078 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:21:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 2036 transitions. [2024-10-29 15:21:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-29 15:21:50,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:50,082 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] [2024-10-29 15:21:50,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:21:50,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:50,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:50,083 INFO L85 PathProgramCache]: Analyzing trace with hash -507708417, now seen corresponding path program 1 times [2024-10-29 15:21:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:50,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88693094] [2024-10-29 15:21:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:50,496 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:21:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88693094] [2024-10-29 15:21:50,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88693094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:50,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:50,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019486712] [2024-10-29 15:21:50,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:21:50,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:50,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:21:50,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:50,499 INFO L87 Difference]: Start difference. First operand 1091 states and 2036 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:50,669 INFO L93 Difference]: Finished difference Result 1175 states and 2188 transitions. [2024-10-29 15:21:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:21:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-29 15:21:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:50,676 INFO L225 Difference]: With dead ends: 1175 [2024-10-29 15:21:50,676 INFO L226 Difference]: Without dead ends: 1122 [2024-10-29 15:21:50,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:50,677 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 163 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:50,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 526 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:21:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-29 15:21:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1106. [2024-10-29 15:21:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1091 states have (on average 1.8854262144821266) internal successors, (2057), 1105 states have internal predecessors, (2057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:50,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 2057 transitions. [2024-10-29 15:21:50,713 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 2057 transitions. Word has length 57 [2024-10-29 15:21:50,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:50,713 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 2057 transitions. [2024-10-29 15:21:50,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 2057 transitions. [2024-10-29 15:21:50,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-29 15:21:50,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:50,716 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] [2024-10-29 15:21:50,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:21:50,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:50,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:50,717 INFO L85 PathProgramCache]: Analyzing trace with hash 873607965, now seen corresponding path program 1 times [2024-10-29 15:21:50,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:50,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990897455] [2024-10-29 15:21:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:50,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:21:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990897455] [2024-10-29 15:21:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990897455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851503946] [2024-10-29 15:21:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:21:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:50,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:21:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:50,918 INFO L87 Difference]: Start difference. First operand 1106 states and 2057 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:51,047 INFO L93 Difference]: Finished difference Result 1199 states and 2214 transitions. [2024-10-29 15:21:51,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:21:51,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-29 15:21:51,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:51,054 INFO L225 Difference]: With dead ends: 1199 [2024-10-29 15:21:51,054 INFO L226 Difference]: Without dead ends: 1167 [2024-10-29 15:21:51,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:51,055 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 72 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:51,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 370 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:21:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-10-29 15:21:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1147. [2024-10-29 15:21:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1133 states have (on average 1.8905560458958517) internal successors, (2142), 1146 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 2142 transitions. [2024-10-29 15:21:51,075 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 2142 transitions. Word has length 61 [2024-10-29 15:21:51,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:51,076 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 2142 transitions. [2024-10-29 15:21:51,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2142 transitions. [2024-10-29 15:21:51,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-29 15:21:51,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:51,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:51,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:21:51,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -351731137, now seen corresponding path program 1 times [2024-10-29 15:21:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:51,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732567949] [2024-10-29 15:21:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:51,120 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:21:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732567949] [2024-10-29 15:21:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732567949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919565959] [2024-10-29 15:21:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:51,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:51,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:51,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:51,122 INFO L87 Difference]: Start difference. First operand 1147 states and 2142 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:51,138 INFO L93 Difference]: Finished difference Result 1147 states and 2142 transitions. [2024-10-29 15:21:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-29 15:21:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:51,143 INFO L225 Difference]: With dead ends: 1147 [2024-10-29 15:21:51,143 INFO L226 Difference]: Without dead ends: 770 [2024-10-29 15:21:51,144 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:21:51,145 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 49 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:51,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 279 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-29 15:21:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2024-10-29 15:21:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 762 states have (on average 1.8490813648293962) internal successors, (1409), 769 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1409 transitions. [2024-10-29 15:21:51,162 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1409 transitions. Word has length 62 [2024-10-29 15:21:51,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:51,163 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1409 transitions. [2024-10-29 15:21:51,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1409 transitions. [2024-10-29 15:21:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:21:51,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:51,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:51,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:21:51,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-10-29 15:21:51,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash 208217909, now seen corresponding path program 1 times [2024-10-29 15:21:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:51,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963082978] [2024-10-29 15:21:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:51,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:21:51,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:21:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:21:51,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:21:51,260 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:21:51,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-29 15:21:51,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-29 15:21:51,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-29 15:21:51,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-29 15:21:51,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-29 15:21:51,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-29 15:21:51,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-29 15:21:51,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-29 15:21:51,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-29 15:21:51,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-29 15:21:51,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:21:51,267 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:51,269 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:21:51,269 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-29 15:21:51,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-29 15:21:51,292 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:21:51,296 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 155 transitions, 326 flow [2024-10-29 15:21:52,100 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33055 states, 32928 states have (on average 2.9254737609329444) internal successors, (96330), 33054 states have internal predecessors, (96330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:52,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:21:52,102 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;@704b9986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:21:52,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-29 15:21:52,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 33055 states, 32928 states have (on average 2.9254737609329444) internal successors, (96330), 33054 states have internal predecessors, (96330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-29 15:21:52,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:52,315 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:21:52,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:21:52,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:52,319 INFO L85 PathProgramCache]: Analyzing trace with hash -398444194, now seen corresponding path program 1 times [2024-10-29 15:21:52,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299507716] [2024-10-29 15:21:52,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:52,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:52,406 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:21:52,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299507716] [2024-10-29 15:21:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299507716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729051959] [2024-10-29 15:21:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:52,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:21:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:21:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:21:52,466 INFO L87 Difference]: Start difference. First operand has 33055 states, 32928 states have (on average 2.9254737609329444) internal successors, (96330), 33054 states have internal predecessors, (96330), 0 states have call successors, (0), 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 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:53,337 INFO L93 Difference]: Finished difference Result 60640 states and 175758 transitions. [2024-10-29 15:21:53,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-29 15:21:53,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:53,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:53,654 INFO L225 Difference]: With dead ends: 60640 [2024-10-29 15:21:53,654 INFO L226 Difference]: Without dead ends: 27236 [2024-10-29 15:21:53,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:21:53,711 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 217 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:53,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 410 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:21:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27236 states. [2024-10-29 15:21:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27236 to 25985. [2024-10-29 15:21:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25985 states, 25857 states have (on average 2.8141702440344973) internal successors, (72766), 25984 states have internal predecessors, (72766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25985 states to 25985 states and 72766 transitions. [2024-10-29 15:21:54,784 INFO L78 Accepts]: Start accepts. Automaton has 25985 states and 72766 transitions. Word has length 44 [2024-10-29 15:21:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:54,784 INFO L471 AbstractCegarLoop]: Abstraction has 25985 states and 72766 transitions. [2024-10-29 15:21:54,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 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:21:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 25985 states and 72766 transitions. [2024-10-29 15:21:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-29 15:21:54,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:54,785 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] [2024-10-29 15:21:54,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 15:21:54,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:21:54,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1049289079, now seen corresponding path program 1 times [2024-10-29 15:21:54,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:54,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281642277] [2024-10-29 15:21:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:55,067 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:21:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281642277] [2024-10-29 15:21:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281642277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791699102] [2024-10-29 15:21:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:21:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:55,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:21:55,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:55,070 INFO L87 Difference]: Start difference. First operand 25985 states and 72766 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:55,336 INFO L93 Difference]: Finished difference Result 29233 states and 81676 transitions. [2024-10-29 15:21:55,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:21:55,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2024-10-29 15:21:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:55,479 INFO L225 Difference]: With dead ends: 29233 [2024-10-29 15:21:55,480 INFO L226 Difference]: Without dead ends: 28726 [2024-10-29 15:21:55,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:55,604 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 160 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:55,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 436 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-29 15:21:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28726 states. [2024-10-29 15:21:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28726 to 27648. [2024-10-29 15:21:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27648 states, 27523 states have (on average 2.816880427279003) internal successors, (77529), 27647 states have internal predecessors, (77529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:56,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27648 states to 27648 states and 77529 transitions. [2024-10-29 15:21:56,395 INFO L78 Accepts]: Start accepts. Automaton has 27648 states and 77529 transitions. Word has length 45 [2024-10-29 15:21:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 27648 states and 77529 transitions. [2024-10-29 15:21:56,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 27648 states and 77529 transitions. [2024-10-29 15:21:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-29 15:21:56,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:56,396 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:21:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 15:21:56,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:21:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1371913771, now seen corresponding path program 1 times [2024-10-29 15:21:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009104929] [2024-10-29 15:21:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:56,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:56,416 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:21:56,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:56,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009104929] [2024-10-29 15:21:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009104929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:56,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093142167] [2024-10-29 15:21:56,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:56,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:56,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:56,418 INFO L87 Difference]: Start difference. First operand 27648 states and 77529 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:21:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:56,747 INFO L93 Difference]: Finished difference Result 36948 states and 102369 transitions. [2024-10-29 15:21:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:56,748 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:21:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:56,921 INFO L225 Difference]: With dead ends: 36948 [2024-10-29 15:21:56,921 INFO L226 Difference]: Without dead ends: 34632 [2024-10-29 15:21:56,947 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:21:56,947 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 104 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:56,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 342 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34632 states. [2024-10-29 15:21:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34632 to 26572. [2024-10-29 15:21:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26572 states, 26464 states have (on average 2.8019195888754536) internal successors, (74150), 26571 states have internal predecessors, (74150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26572 states to 26572 states and 74150 transitions. [2024-10-29 15:21:57,944 INFO L78 Accepts]: Start accepts. Automaton has 26572 states and 74150 transitions. Word has length 49 [2024-10-29 15:21:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 26572 states and 74150 transitions. [2024-10-29 15:21:57,945 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:21:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 26572 states and 74150 transitions. [2024-10-29 15:21:57,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-29 15:21:57,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:57,946 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] [2024-10-29 15:21:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 15:21:57,946 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:21:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 478959066, now seen corresponding path program 1 times [2024-10-29 15:21:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484801063] [2024-10-29 15:21:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:58,112 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:21:58,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:58,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484801063] [2024-10-29 15:21:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484801063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047233577] [2024-10-29 15:21:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:58,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:21:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:21:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:58,114 INFO L87 Difference]: Start difference. First operand 26572 states and 74150 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:58,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:58,806 INFO L93 Difference]: Finished difference Result 40812 states and 114892 transitions. [2024-10-29 15:21:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:21:58,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-29 15:21:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:58,974 INFO L225 Difference]: With dead ends: 40812 [2024-10-29 15:21:58,975 INFO L226 Difference]: Without dead ends: 39627 [2024-10-29 15:21:59,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:21:59,000 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 289 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:59,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 797 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:21:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39627 states. [2024-10-29 15:21:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39627 to 30867. [2024-10-29 15:21:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30867 states, 30759 states have (on average 2.814493319028577) internal successors, (86571), 30866 states have internal predecessors, (86571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30867 states to 30867 states and 86571 transitions. [2024-10-29 15:21:59,769 INFO L78 Accepts]: Start accepts. Automaton has 30867 states and 86571 transitions. Word has length 57 [2024-10-29 15:21:59,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:59,770 INFO L471 AbstractCegarLoop]: Abstraction has 30867 states and 86571 transitions. [2024-10-29 15:21:59,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 30867 states and 86571 transitions. [2024-10-29 15:21:59,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-29 15:21:59,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:59,773 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] [2024-10-29 15:21:59,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 15:21:59,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:21:59,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -576630333, now seen corresponding path program 1 times [2024-10-29 15:21:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869415525] [2024-10-29 15:21:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:59,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:22:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869415525] [2024-10-29 15:22:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869415525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:00,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423041688] [2024-10-29 15:22:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:00,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:00,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:00,362 INFO L87 Difference]: Start difference. First operand 30867 states and 86571 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:00,785 INFO L93 Difference]: Finished difference Result 33820 states and 94242 transitions. [2024-10-29 15:22:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:00,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-29 15:22:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:00,926 INFO L225 Difference]: With dead ends: 33820 [2024-10-29 15:22:00,926 INFO L226 Difference]: Without dead ends: 33218 [2024-10-29 15:22:00,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:00,944 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 141 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:00,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 700 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33218 states. [2024-10-29 15:22:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33218 to 32545. [2024-10-29 15:22:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32545 states, 32440 states have (on average 2.8154747225647347) internal successors, (91334), 32544 states have internal predecessors, (91334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32545 states to 32545 states and 91334 transitions. [2024-10-29 15:22:02,202 INFO L78 Accepts]: Start accepts. Automaton has 32545 states and 91334 transitions. Word has length 61 [2024-10-29 15:22:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 32545 states and 91334 transitions. [2024-10-29 15:22:02,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 32545 states and 91334 transitions. [2024-10-29 15:22:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-29 15:22:02,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:02,204 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] [2024-10-29 15:22:02,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 15:22:02,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:02,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:02,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2023845364, now seen corresponding path program 1 times [2024-10-29 15:22:02,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:02,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98653923] [2024-10-29 15:22:02,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:02,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:02,238 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:22:02,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98653923] [2024-10-29 15:22:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98653923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:02,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:02,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799773744] [2024-10-29 15:22:02,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:02,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:02,240 INFO L87 Difference]: Start difference. First operand 32545 states and 91334 transitions. Second operand has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:02,379 INFO L93 Difference]: Finished difference Result 35792 states and 100602 transitions. [2024-10-29 15:22:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:02,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-29 15:22:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:02,503 INFO L225 Difference]: With dead ends: 35792 [2024-10-29 15:22:02,503 INFO L226 Difference]: Without dead ends: 33125 [2024-10-29 15:22:02,522 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:22:02,523 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 87 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:02,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 350 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33125 states. [2024-10-29 15:22:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33125 to 32075. [2024-10-29 15:22:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32075 states, 31978 states have (on average 2.8142160235161673) internal successors, (89993), 32074 states have internal predecessors, (89993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32075 states to 32075 states and 89993 transitions. [2024-10-29 15:22:03,586 INFO L78 Accepts]: Start accepts. Automaton has 32075 states and 89993 transitions. Word has length 62 [2024-10-29 15:22:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:03,587 INFO L471 AbstractCegarLoop]: Abstraction has 32075 states and 89993 transitions. [2024-10-29 15:22:03,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32075 states and 89993 transitions. [2024-10-29 15:22:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-29 15:22:03,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:03,588 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] [2024-10-29 15:22:03,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 15:22:03,589 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1002653950, now seen corresponding path program 1 times [2024-10-29 15:22:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:03,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362145724] [2024-10-29 15:22:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-29 15:22:03,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:03,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362145724] [2024-10-29 15:22:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362145724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:03,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-29 15:22:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677425847] [2024-10-29 15:22:03,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:22:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:22:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:22:03,973 INFO L87 Difference]: Start difference. First operand 32075 states and 89993 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:05,156 INFO L93 Difference]: Finished difference Result 43049 states and 120588 transitions. [2024-10-29 15:22:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-29 15:22:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-29 15:22:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:05,319 INFO L225 Difference]: With dead ends: 43049 [2024-10-29 15:22:05,319 INFO L226 Difference]: Without dead ends: 41767 [2024-10-29 15:22:05,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2024-10-29 15:22:05,334 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 538 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:05,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 969 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-29 15:22:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41767 states. [2024-10-29 15:22:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41767 to 31484. [2024-10-29 15:22:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31484 states, 31388 states have (on average 2.8107557028163628) internal successors, (88224), 31483 states have internal predecessors, (88224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31484 states to 31484 states and 88224 transitions. [2024-10-29 15:22:06,071 INFO L78 Accepts]: Start accepts. Automaton has 31484 states and 88224 transitions. Word has length 68 [2024-10-29 15:22:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:06,071 INFO L471 AbstractCegarLoop]: Abstraction has 31484 states and 88224 transitions. [2024-10-29 15:22:06,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 31484 states and 88224 transitions. [2024-10-29 15:22:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-29 15:22:06,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:06,073 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] [2024-10-29 15:22:06,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 15:22:06,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:06,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:06,074 INFO L85 PathProgramCache]: Analyzing trace with hash 543047597, now seen corresponding path program 1 times [2024-10-29 15:22:06,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:06,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599165593] [2024-10-29 15:22:06,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:06,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-29 15:22:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:06,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599165593] [2024-10-29 15:22:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599165593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-29 15:22:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452129864] [2024-10-29 15:22:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-29 15:22:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-29 15:22:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-29 15:22:06,645 INFO L87 Difference]: Start difference. First operand 31484 states and 88224 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:07,177 INFO L93 Difference]: Finished difference Result 31484 states and 88224 transitions. [2024-10-29 15:22:07,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-29 15:22:07,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2024-10-29 15:22:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:07,302 INFO L225 Difference]: With dead ends: 31484 [2024-10-29 15:22:07,303 INFO L226 Difference]: Without dead ends: 30979 [2024-10-29 15:22:07,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-10-29 15:22:07,318 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 382 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:07,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 702 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-29 15:22:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30979 states. [2024-10-29 15:22:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30979 to 28959. [2024-10-29 15:22:07,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28959 states, 28880 states have (on average 2.8057825484764543) internal successors, (81031), 28958 states have internal predecessors, (81031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28959 states to 28959 states and 81031 transitions. [2024-10-29 15:22:08,370 INFO L78 Accepts]: Start accepts. Automaton has 28959 states and 81031 transitions. Word has length 68 [2024-10-29 15:22:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:08,370 INFO L471 AbstractCegarLoop]: Abstraction has 28959 states and 81031 transitions. [2024-10-29 15:22:08,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28959 states and 81031 transitions. [2024-10-29 15:22:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-29 15:22:08,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:08,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 15:22:08,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2134662892, now seen corresponding path program 1 times [2024-10-29 15:22:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792638470] [2024-10-29 15:22:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:08,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-29 15:22:08,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792638470] [2024-10-29 15:22:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792638470] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-29 15:22:08,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941362971] [2024-10-29 15:22:08,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-29 15:22:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:22:08,786 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:22:08,788 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:22:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:08,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-29 15:22:08,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-29 15:22:08,943 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-29 15:22:08,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-29 15:22:09,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-29 15:22:09,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-29 15:22:09,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:22:09,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-29 15:22:09,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:22:09,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-29 15:22:09,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2024-10-29 15:22:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-29 15:22:09,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-29 15:22:09,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 3 |c_ULTIMATE.start_main_~#t~1#1.offset|)))) (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#race| |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)))) is different from false [2024-10-29 15:22:09,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t~1#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet7#1|)))) (and (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2))) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset|)))))))) is different from false [2024-10-29 15:22:09,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse1 2 |c_ULTIMATE.start_main_~#t~1#1.offset|)) (.cse2 (+ .cse1 3 |c_ULTIMATE.start_main_~#t~1#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#t~1#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet7#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet7#1|)))) (and (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset|)) |c_ULTIMATE.start_main_#t~nondet7#1|)) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~#t~1#1.offset| 1)))) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse2))) (forall ((v_ArrVal_326 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet7#1| (select (select (store .cse0 |c_~#a~0.base| v_ArrVal_326) |c_ULTIMATE.start_main_~#t~1#1.base|) .cse3))))))) is different from false [2024-10-29 15:22:11,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:22:11,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-29 15:22:11,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-29 15:22:11,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2024-10-29 15:22:11,267 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:22:11,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-29 15:22:11,271 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:22:11,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-29 15:22:11,275 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-29 15:22:11,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-29 15:22:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 6 trivial. 2 not checked. [2024-10-29 15:22:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941362971] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-29 15:22:11,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-29 15:22:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-29 15:22:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185274263] [2024-10-29 15:22:11,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-29 15:22:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-29 15:22:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-29 15:22:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=251, Unknown=11, NotChecked=108, Total=462 [2024-10-29 15:22:11,348 INFO L87 Difference]: Start difference. First operand 28959 states and 81031 transitions. Second operand has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:11,888 INFO L93 Difference]: Finished difference Result 28959 states and 81031 transitions. [2024-10-29 15:22:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-29 15:22:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 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 69 [2024-10-29 15:22:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:11,989 INFO L225 Difference]: With dead ends: 28959 [2024-10-29 15:22:11,990 INFO L226 Difference]: Without dead ends: 28472 [2024-10-29 15:22:12,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=168, Invalid=385, Unknown=11, NotChecked=138, Total=702 [2024-10-29 15:22:12,003 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 793 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1038 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:12,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 551 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 351 Invalid, 0 Unknown, 1038 Unchecked, 0.3s Time] [2024-10-29 15:22:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28472 states. [2024-10-29 15:22:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28472 to 26524. [2024-10-29 15:22:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26524 states, 26458 states have (on average 2.7985108473807543) internal successors, (74043), 26523 states have internal predecessors, (74043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26524 states to 26524 states and 74043 transitions. [2024-10-29 15:22:12,675 INFO L78 Accepts]: Start accepts. Automaton has 26524 states and 74043 transitions. Word has length 69 [2024-10-29 15:22:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:12,676 INFO L471 AbstractCegarLoop]: Abstraction has 26524 states and 74043 transitions. [2024-10-29 15:22:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 6.095238095238095) internal successors, (128), 22 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26524 states and 74043 transitions. [2024-10-29 15:22:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-29 15:22:12,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:12,679 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:12,696 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:22:12,879 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,SelfDestructingSolverStorable15 [2024-10-29 15:22:12,880 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:12,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:12,881 INFO L85 PathProgramCache]: Analyzing trace with hash 807094271, now seen corresponding path program 1 times [2024-10-29 15:22:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592116283] [2024-10-29 15:22:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 15:22:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592116283] [2024-10-29 15:22:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592116283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:22:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606237344] [2024-10-29 15:22:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:13,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 15:22:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 15:22:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:13,068 INFO L87 Difference]: Start difference. First operand 26524 states and 74043 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:13,446 INFO L93 Difference]: Finished difference Result 37958 states and 106277 transitions. [2024-10-29 15:22:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 15:22:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-29 15:22:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:13,569 INFO L225 Difference]: With dead ends: 37958 [2024-10-29 15:22:13,570 INFO L226 Difference]: Without dead ends: 36692 [2024-10-29 15:22:13,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 15:22:13,589 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 277 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:13,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 819 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-29 15:22:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36692 states. [2024-10-29 15:22:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36692 to 28892. [2024-10-29 15:22:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28892 states, 28828 states have (on average 2.7974538642985984) internal successors, (80645), 28891 states have internal predecessors, (80645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:14,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28892 states to 28892 states and 80645 transitions. [2024-10-29 15:22:14,373 INFO L78 Accepts]: Start accepts. Automaton has 28892 states and 80645 transitions. Word has length 74 [2024-10-29 15:22:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:14,374 INFO L471 AbstractCegarLoop]: Abstraction has 28892 states and 80645 transitions. [2024-10-29 15:22:14,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28892 states and 80645 transitions. [2024-10-29 15:22:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-29 15:22:14,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:14,378 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:14,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-29 15:22:14,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1601486822, now seen corresponding path program 1 times [2024-10-29 15:22:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534769846] [2024-10-29 15:22:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:22:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 15:22:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:22:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534769846] [2024-10-29 15:22:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534769846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:22:14,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:22:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:22:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792618391] [2024-10-29 15:22:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:22:14,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:22:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:22:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:22:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:22:14,403 INFO L87 Difference]: Start difference. First operand 28892 states and 80645 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:22:14,530 INFO L93 Difference]: Finished difference Result 30982 states and 86222 transitions. [2024-10-29 15:22:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:22:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-29 15:22:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:22:14,636 INFO L225 Difference]: With dead ends: 30982 [2024-10-29 15:22:14,636 INFO L226 Difference]: Without dead ends: 28390 [2024-10-29 15:22:14,653 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:22:14,654 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 84 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:22:14,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 344 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:22:14,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28390 states. [2024-10-29 15:22:15,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28390 to 27898. [2024-10-29 15:22:15,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27898 states, 27846 states have (on average 2.772534654887596) internal successors, (77204), 27897 states have internal predecessors, (77204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27898 states to 27898 states and 77204 transitions. [2024-10-29 15:22:15,581 INFO L78 Accepts]: Start accepts. Automaton has 27898 states and 77204 transitions. Word has length 79 [2024-10-29 15:22:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:22:15,582 INFO L471 AbstractCegarLoop]: Abstraction has 27898 states and 77204 transitions. [2024-10-29 15:22:15,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:22:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 27898 states and 77204 transitions. [2024-10-29 15:22:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-29 15:22:15,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:22:15,588 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:15,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-29 15:22:15,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-10-29 15:22:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:22:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 120497514, now seen corresponding path program 1 times [2024-10-29 15:22:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:22:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767106523] [2024-10-29 15:22:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:22:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:22:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:15,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:22:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:22:15,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:22:15,631 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:22:15,631 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-10-29 15:22:15,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-10-29 15:22:15,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-10-29 15:22:15,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-10-29 15:22:15,631 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-10-29 15:22:15,632 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-10-29 15:22:15,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-29 15:22:15,633 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:22:15,633 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 15:22:15,633 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-29 15:22:15,669 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-29 15:22:15,670 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:22:15,671 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 175 places, 178 transitions, 383 flow