./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i --full-output --witness-type violation_witness --validate ../results-verified/LOGDIR/SV-COMP24_no-data-race/nondet-loop-bound-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-loop-bound-1.i ../results-verified/LOGDIR/SV-COMP24_no-data-race/nondet-loop-bound-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:51,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 15:21:51,559 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:51,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 15:21:51,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 15:21:51,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 15:21:51,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 15:21:51,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 15:21:51,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 15:21:51,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 15:21:51,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 15:21:51,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 15:21:51,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 15:21:51,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 15:21:51,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 15:21:51,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 15:21:51,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 15:21:51,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 15:21:51,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 15:21:51,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 15:21:51,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 15:21:51,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 15:21:51,603 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 15:21:51,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 15:21:51,603 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 15:21:51,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 15:21:51,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 15:21:51,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 15:21:51,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 15:21:51,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 15:21:51,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 15:21:51,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:21:51,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 15:21:51,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 15:21:51,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 15:21:51,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 15:21:51,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 15:21:51,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 15:21:51,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-29 15:21:51,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-29 15:21:51,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-29 15:21:51,610 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:51,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 15:21:51,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 15:21:51,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 15:21:51,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 15:21:51,903 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 15:21:51,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-10-29 15:21:53,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 15:21:53,678 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 15:21:53,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-1.i [2024-10-29 15:21:53,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767fe1ccd/294a1b0c14f24a4bae79a7f380133a37/FLAG613115a9e [2024-10-29 15:21:53,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767fe1ccd/294a1b0c14f24a4bae79a7f380133a37 [2024-10-29 15:21:53,713 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-10-29 15:21:53,713 INFO L274 PluginConnector]: Witness Parser initialized [2024-10-29 15:21:53,714 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-loop-bound-1.yml/witness.graphml [2024-10-29 15:21:53,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 15:21:53,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-10-29 15:21:53,783 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 15:21:53,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 15:21:53,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 15:21:53,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:53" (1/2) ... [2024-10-29 15:21:53,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75feb78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:53, skipping insertion in model container [2024-10-29 15:21:53,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 03:21:53" (1/2) ... [2024-10-29 15:21:53,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2e034906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 03:21:53, skipping insertion in model container [2024-10-29 15:21:53,795 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:53" (2/2) ... [2024-10-29 15:21:53,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75feb78f and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:53, skipping insertion in model container [2024-10-29 15:21:53,795 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:53" (2/2) ... [2024-10-29 15:21:53,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 15:21:54,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:21:54,234 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 15:21:54,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 15:21:54,331 INFO L204 MainTranslator]: Completed translation [2024-10-29 15:21:54,332 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator VIOLATION_WITNESS 29.10 03:21:54 WrapperNode [2024-10-29 15:21:54,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 15:21:54,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 15:21:54,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 15:21:54,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 15:21:54,341 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:54" (1/1) ... [2024-10-29 15:21:54,355 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:54" (1/1) ... [2024-10-29 15:21:54,378 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2024-10-29 15:21:54,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 15:21:54,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 15:21:54,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 15:21:54,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 15:21:54,388 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:54" (1/1) ... [2024-10-29 15:21:54,389 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:54" (1/1) ... [2024-10-29 15:21:54,396 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:54" (1/1) ... [2024-10-29 15:21:54,396 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:54" (1/1) ... [2024-10-29 15:21:54,407 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:54" (1/1) ... [2024-10-29 15:21:54,414 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:54" (1/1) ... [2024-10-29 15:21:54,416 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:54" (1/1) ... [2024-10-29 15:21:54,420 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:54" (1/1) ... [2024-10-29 15:21:54,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 15:21:54,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 15:21:54,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 15:21:54,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 15:21:54,429 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:54" (1/1) ... [2024-10-29 15:21:54,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-29 15:21:54,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-29 15:21:54,469 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:54,475 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:54,528 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-29 15:21:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-29 15:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-29 15:21:54,529 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-29 15:21:54,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 15:21:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 15:21:54,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 15:21:54,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 15:21:54,532 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:54,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 15:21:54,690 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 15:21:54,915 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 15:21:54,915 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 15:21:54,940 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 15:21:54,942 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-29 15:21:54,943 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 03:21:54 BoogieIcfgContainer [2024-10-29 15:21:54,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 15:21:54,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 15:21:54,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 15:21:54,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 15:21:54,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 03:21:53" (1/4) ... [2024-10-29 15:21:54,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea45e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 03:21:54, skipping insertion in model container [2024-10-29 15:21:54,952 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:53" (2/4) ... [2024-10-29 15:21:54,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea45e07 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:54, skipping insertion in model container [2024-10-29 15:21:54,953 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:54" (3/4) ... [2024-10-29 15:21:54,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea45e07 and model type witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction VIOLATION_WITNESS 29.10 03:21:54, skipping insertion in model container [2024-10-29 15:21:54,955 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:54" (4/4) ... [2024-10-29 15:21:54,956 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2024-10-29 15:21:54,957 WARN L117 eAbstractionObserver]: Found a witness automaton. I will only consider traces that are accepted by the witness automaton [2024-10-29 15:21:54,982 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 15:21:54,983 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-10-29 15:21:54,983 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 15:21:55,052 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-29 15:21:55,072 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:55,085 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 111 transitions, 230 flow [2024-10-29 15:21:55,354 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5678 states, 5643 states have (on average 2.922381711855396) internal successors, (16491), 5677 states have internal predecessors, (16491), 0 states have call successors, (0), 0 states have call 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,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-29 15:21:55,442 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;@28f5336e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 15:21:55,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-29 15:21:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 5678 states, 5643 states have (on average 2.922381711855396) internal successors, (16491), 5677 states have internal predecessors, (16491), 0 states have call successors, (0), 0 states have call 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,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-29 15:21:55,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:55,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:55,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1524266874, now seen corresponding path program 1 times [2024-10-29 15:21:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:55,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439539561] [2024-10-29 15:21:55,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:55,761 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,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439539561] [2024-10-29 15:21:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439539561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:55,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482503242] [2024-10-29 15:21:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:55,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:55,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:55,820 INFO L87 Difference]: Start difference. First operand has 5678 states, 5643 states have (on average 2.922381711855396) internal successors, (16491), 5677 states have internal predecessors, (16491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call 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,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:56,046 INFO L93 Difference]: Finished difference Result 10767 states and 31367 transitions. [2024-10-29 15:21:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:56,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2024-10-29 15:21:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:56,111 INFO L225 Difference]: With dead ends: 10767 [2024-10-29 15:21:56,112 INFO L226 Difference]: Without dead ends: 5130 [2024-10-29 15:21:56,133 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,140 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:56,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:56,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2024-10-29 15:21:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5130. [2024-10-29 15:21:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5130 states, 5087 states have (on average 2.7808138391979558) internal successors, (14146), 5129 states have internal predecessors, (14146), 0 states have call successors, (0), 0 states have call 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,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5130 states to 5130 states and 14146 transitions. [2024-10-29 15:21:56,444 INFO L78 Accepts]: Start accepts. Automaton has 5130 states and 14146 transitions. Word has length 19 [2024-10-29 15:21:56,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:56,445 INFO L471 AbstractCegarLoop]: Abstraction has 5130 states and 14146 transitions. [2024-10-29 15:21:56,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call 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,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5130 states and 14146 transitions. [2024-10-29 15:21:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-29 15:21:56,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:56,446 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] [2024-10-29 15:21:56,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 15:21:56,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 850971737, now seen corresponding path program 1 times [2024-10-29 15:21:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:56,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321050459] [2024-10-29 15:21:56,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:56,556 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,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:56,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321050459] [2024-10-29 15:21:56,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321050459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:56,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:56,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231453393] [2024-10-29 15:21:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:56,562 INFO L87 Difference]: Start difference. First operand 5130 states and 14146 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:56,696 INFO L93 Difference]: Finished difference Result 5130 states and 14146 transitions. [2024-10-29 15:21:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-10-29 15:21:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:56,742 INFO L225 Difference]: With dead ends: 5130 [2024-10-29 15:21:56,743 INFO L226 Difference]: Without dead ends: 5129 [2024-10-29 15:21:56,749 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,751 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:56,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2024-10-29 15:21:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 5129. [2024-10-29 15:21:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5087 states have (on average 2.780617259681541) internal successors, (14145), 5128 states have internal predecessors, (14145), 0 states have call successors, (0), 0 states have call 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,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 14145 transitions. [2024-10-29 15:21:56,981 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 14145 transitions. Word has length 25 [2024-10-29 15:21:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 5129 states and 14145 transitions. [2024-10-29 15:21:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call 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,983 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 14145 transitions. [2024-10-29 15:21:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-29 15:21:56,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:56,984 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] [2024-10-29 15:21:56,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 15:21:56,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:56,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1456105701, now seen corresponding path program 1 times [2024-10-29 15:21:56,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:56,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544079029] [2024-10-29 15:21:56,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:56,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:57,081 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:57,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:57,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544079029] [2024-10-29 15:21:57,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544079029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:57,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:57,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:57,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093396841] [2024-10-29 15:21:57,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:57,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:57,086 INFO L87 Difference]: Start difference. First operand 5129 states and 14145 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:57,162 INFO L93 Difference]: Finished difference Result 5129 states and 14145 transitions. [2024-10-29 15:21:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-10-29 15:21:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:57,200 INFO L225 Difference]: With dead ends: 5129 [2024-10-29 15:21:57,200 INFO L226 Difference]: Without dead ends: 4527 [2024-10-29 15:21:57,206 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:57,207 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 66 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:57,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 116 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2024-10-29 15:21:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4527. [2024-10-29 15:21:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4527 states, 4510 states have (on average 2.761640798226164) internal successors, (12455), 4526 states have internal predecessors, (12455), 0 states have call successors, (0), 0 states have call 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,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4527 states to 4527 states and 12455 transitions. [2024-10-29 15:21:57,384 INFO L78 Accepts]: Start accepts. Automaton has 4527 states and 12455 transitions. Word has length 29 [2024-10-29 15:21:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:57,385 INFO L471 AbstractCegarLoop]: Abstraction has 4527 states and 12455 transitions. [2024-10-29 15:21:57,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call 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,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4527 states and 12455 transitions. [2024-10-29 15:21:57,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-29 15:21:57,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:57,387 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:57,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 15:21:57,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:57,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1667615661, now seen corresponding path program 1 times [2024-10-29 15:21:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255275008] [2024-10-29 15:21:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:57,478 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:57,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255275008] [2024-10-29 15:21:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255275008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:57,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897166821] [2024-10-29 15:21:57,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:57,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:57,481 INFO L87 Difference]: Start difference. First operand 4527 states and 12455 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:57,559 INFO L93 Difference]: Finished difference Result 5718 states and 15573 transitions. [2024-10-29 15:21:57,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:57,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:57,618 INFO L225 Difference]: With dead ends: 5718 [2024-10-29 15:21:57,618 INFO L226 Difference]: Without dead ends: 5060 [2024-10-29 15:21:57,624 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:57,628 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 201 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2024-10-29 15:21:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 4059. [2024-10-29 15:21:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4059 states, 4049 states have (on average 2.7441343541615213) internal successors, (11111), 4058 states have internal predecessors, (11111), 0 states have call successors, (0), 0 states have call 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,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 11111 transitions. [2024-10-29 15:21:57,803 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 11111 transitions. Word has length 45 [2024-10-29 15:21:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:57,804 INFO L471 AbstractCegarLoop]: Abstraction has 4059 states and 11111 transitions. [2024-10-29 15:21:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 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:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 11111 transitions. [2024-10-29 15:21:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-29 15:21:57,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:57,809 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:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 15:21:57,809 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:57,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -385399741, now seen corresponding path program 1 times [2024-10-29 15:21:57,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:57,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707568045] [2024-10-29 15:21:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:57,880 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:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:57,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707568045] [2024-10-29 15:21:57,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707568045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:57,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:57,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-29 15:21:57,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672731091] [2024-10-29 15:21:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:57,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-29 15:21:57,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:57,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-29 15:21:57,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-29 15:21:57,883 INFO L87 Difference]: Start difference. First operand 4059 states and 11111 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 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:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:57,941 INFO L93 Difference]: Finished difference Result 4754 states and 13007 transitions. [2024-10-29 15:21:57,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-29 15:21:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 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:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:57,966 INFO L225 Difference]: With dead ends: 4754 [2024-10-29 15:21:57,966 INFO L226 Difference]: Without dead ends: 3710 [2024-10-29 15:21:57,972 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:57,973 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 34 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:57,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 206 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:57,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-10-29 15:21:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3528. [2024-10-29 15:21:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3520 states have (on average 2.696022727272727) internal successors, (9490), 3527 states have internal predecessors, (9490), 0 states have call successors, (0), 0 states have call 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,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 9490 transitions. [2024-10-29 15:21:58,137 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 9490 transitions. Word has length 61 [2024-10-29 15:21:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 9490 transitions. [2024-10-29 15:21:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 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:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 9490 transitions. [2024-10-29 15:21:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-29 15:21:58,149 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:58,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:58,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 15:21:58,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:58,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1268631560, now seen corresponding path program 1 times [2024-10-29 15:21:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501792846] [2024-10-29 15:21:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 15:21:58,313 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,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 15:21:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501792846] [2024-10-29 15:21:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501792846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 15:21:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 15:21:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 15:21:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028947781] [2024-10-29 15:21:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 15:21:58,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-29 15:21:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 15:21:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-29 15:21:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-29 15:21:58,318 INFO L87 Difference]: Start difference. First operand 3528 states and 9490 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-29 15:21:58,437 INFO L93 Difference]: Finished difference Result 7022 states and 18945 transitions. [2024-10-29 15:21:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-29 15:21:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-29 15:21:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-29 15:21:58,463 INFO L225 Difference]: With dead ends: 7022 [2024-10-29 15:21:58,464 INFO L226 Difference]: Without dead ends: 3528 [2024-10-29 15:21:58,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-29 15:21:58,478 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-29 15:21:58,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 358 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-29 15:21:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-10-29 15:21:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3528. [2024-10-29 15:21:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3520 states have (on average 2.6957386363636364) internal successors, (9489), 3527 states have internal predecessors, (9489), 0 states have call successors, (0), 0 states have call 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,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 9489 transitions. [2024-10-29 15:21:58,602 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 9489 transitions. Word has length 63 [2024-10-29 15:21:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-29 15:21:58,644 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 9489 transitions. [2024-10-29 15:21:58,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 15:21:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 9489 transitions. [2024-10-29 15:21:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-29 15:21:58,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-29 15:21:58,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:58,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 15:21:58,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-29 15:21:58,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 15:21:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1247767711, now seen corresponding path program 1 times [2024-10-29 15:21:58,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 15:21:58,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728612435] [2024-10-29 15:21:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 15:21:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 15:21:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:21:58,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 15:21:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 15:21:58,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 15:21:58,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 15:21:58,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2024-10-29 15:21:58,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-29 15:21:58,733 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-29 15:21:58,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-29 15:21:58,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-29 15:21:58,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-29 15:21:58,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-29 15:21:58,734 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-29 15:21:58,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-29 15:21:58,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-29 15:21:58,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2024-10-29 15:21:58,735 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2024-10-29 15:21:58,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-29 15:21:58,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-29 15:21:58,736 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-29 15:21:58,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 15:21:58,740 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-29 15:21:58,798 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-29 15:21:58,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-29 15:21:58,802 INFO L201 PluginConnector]: Adding new model witness.graphml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 03:21:58 BasicIcfg [2024-10-29 15:21:58,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-29 15:21:58,803 INFO L158 Benchmark]: Toolchain (without parser) took 5022.61ms. Allocated memory was 123.7MB in the beginning and 421.5MB in the end (delta: 297.8MB). Free memory was 64.5MB in the beginning and 305.3MB in the end (delta: -240.8MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,803 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 123.7MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:21:58,803 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-29 15:21:58,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.41ms. Allocated memory was 123.7MB in the beginning and 174.1MB in the end (delta: 50.3MB). Free memory was 64.3MB in the beginning and 135.4MB in the end (delta: -71.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.66ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 133.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,804 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 132.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,804 INFO L158 Benchmark]: RCFGBuilder took 515.48ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 116.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,805 INFO L158 Benchmark]: TraceAbstraction took 3857.25ms. Allocated memory was 174.1MB in the beginning and 421.5MB in the end (delta: 247.5MB). Free memory was 116.6MB in the beginning and 305.3MB in the end (delta: -188.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-10-29 15:21:58,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 123.7MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 66.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.41ms. Allocated memory was 123.7MB in the beginning and 174.1MB in the end (delta: 50.3MB). Free memory was 64.3MB in the beginning and 135.4MB in the end (delta: -71.1MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.66ms. Allocated memory is still 174.1MB. Free memory was 135.4MB in the beginning and 133.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.98ms. Allocated memory is still 174.1MB. Free memory was 133.4MB in the beginning and 132.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.48ms. Allocated memory is still 174.1MB. Free memory was 132.2MB in the beginning and 116.6MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3857.25ms. Allocated memory was 174.1MB in the beginning and 421.5MB in the end (delta: 247.5MB). Free memory was 116.6MB in the beginning and 305.3MB in the end (delta: -188.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L701] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L702] 0 int i; VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L703] 0 x = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=0, x=0] [L704] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, x=0] [L705] EXPR 0 n >= 20 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, x=0] [L705] EXPR 0 n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, x=0] [L705] EXPR 0 n >= 20 && n < 40 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, x=0] [L705] CALL 0 assume_abort_if_not(n >= 20 && n < 40) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, n=20, x=0] [L705] RET 0 assume_abort_if_not(n >= 20 && n < 40) [L706] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, n=20, t1=-1, x=0] [L693] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, n=20, x=0] [L707] 0 i = 0 VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=20, t1=-1, x=0] [L707] 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=20, t1=-1, x=0] [L707] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=20, t1=-1, x=0] [L708] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(arg)={0:0}, \old(argc)=52, \old(argv)={53:51}, argc=52, i=0, n=20, t1=-1, t2=0, x=0] [L696] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, n=20, x=0] [L697] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, n=20, t=0, x=0] [L698] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, n=20, t=0, x=1] [L693] 1 x < n VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, n=20, t=0, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [698] and C: x < n [693] - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 142 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 1245 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 620 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 625 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5678occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 1183 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 253 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-29 15:21:58,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE