./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-atomic/dekker-unfair.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker-unfair.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 15:02:40,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 15:02:40,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 15:02:40,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 15:02:40,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 15:02:40,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 15:02:40,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 15:02:40,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 15:02:40,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 15:02:40,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 15:02:40,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 15:02:40,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 15:02:40,777 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 15:02:40,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 15:02:40,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 15:02:40,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 15:02:40,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:02:40,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 15:02:40,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 15:02:40,780 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 15:02:40,780 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 15:02:40,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 15:02:40,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5850bf916a69badaacd3ff4150d219aedc42421ae90c33080aafb727bc040d43 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 15:02:41,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 15:02:41,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 15:02:41,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 15:02:41,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 15:02:41,086 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 15:02:41,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker-unfair.i [2025-01-23 15:02:42,219 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e985b5909/b8f3a21dcc5f44fa8742ccec6b377acb/FLAGa594c5aa1 [2025-01-23 15:02:42,438 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 15:02:42,438 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-atomic/dekker-unfair.i [2025-01-23 15:02:42,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e985b5909/b8f3a21dcc5f44fa8742ccec6b377acb/FLAGa594c5aa1 [2025-01-23 15:02:42,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/e985b5909/b8f3a21dcc5f44fa8742ccec6b377acb [2025-01-23 15:02:42,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 15:02:42,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 15:02:42,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 15:02:42,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 15:02:42,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 15:02:42,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:02:42" (1/1) ... [2025-01-23 15:02:42,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a1f6089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:42, skipping insertion in model container [2025-01-23 15:02:42,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 03:02:42" (1/1) ... [2025-01-23 15:02:42,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 15:02:42,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-atomic/dekker-unfair.i[32921,32934] [2025-01-23 15:02:43,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-atomic/dekker-unfair.i[33157,33170] [2025-01-23 15:02:43,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:02:43,014 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 15:02:43,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-atomic/dekker-unfair.i[32921,32934] [2025-01-23 15:02:43,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-atomic/dekker-unfair.i[33157,33170] [2025-01-23 15:02:43,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 15:02:43,130 INFO L204 MainTranslator]: Completed translation [2025-01-23 15:02:43,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43 WrapperNode [2025-01-23 15:02:43,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 15:02:43,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 15:02:43,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 15:02:43,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 15:02:43,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,166 INFO L138 Inliner]: procedures = 167, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-01-23 15:02:43,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 15:02:43,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 15:02:43,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 15:02:43,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 15:02:43,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 15:02:43,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 15:02:43,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 15:02:43,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 15:02:43,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (1/1) ... [2025-01-23 15:02:43,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 15:02:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:02:43,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 15:02:43,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 15:02:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-23 15:02:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-23 15:02:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-23 15:02:43,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-23 15:02:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 15:02:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 15:02:43,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 15:02:43,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 15:02:43,254 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 15:02:43,344 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 15:02:43,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 15:02:43,439 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 15:02:43,439 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 15:02:43,513 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 15:02:43,514 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 15:02:43,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:02:43 BoogieIcfgContainer [2025-01-23 15:02:43,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 15:02:43,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 15:02:43,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 15:02:43,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 15:02:43,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 03:02:42" (1/3) ... [2025-01-23 15:02:43,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ab8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:02:43, skipping insertion in model container [2025-01-23 15:02:43,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 03:02:43" (2/3) ... [2025-01-23 15:02:43,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ab8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 03:02:43, skipping insertion in model container [2025-01-23 15:02:43,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:02:43" (3/3) ... [2025-01-23 15:02:43,524 INFO L128 eAbstractionObserver]: Analyzing ICFG dekker-unfair.i [2025-01-23 15:02:43,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 15:02:43,536 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dekker-unfair.i that has 3 procedures, 37 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-01-23 15:02:43,536 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 15:02:43,573 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 15:02:43,598 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 15:02:43,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 15:02:43,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 15:02:43,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 15:02:43,655 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:02:43,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2025-01-23 15:02:43,677 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@26aa0663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:43,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:02:43,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:43,974 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:43,976 INFO L139 ounterexampleChecker]: Examining path program with hash 577721494, occurence #1 [2025-01-23 15:02:43,976 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:43,976 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:43,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 556444219, now seen corresponding path program 1 times [2025-01-23 15:02:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124204373] [2025-01-23 15:02:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 15:02:44,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 15:02:44,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124204373] [2025-01-23 15:02:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124204373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:02:44,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959688533] [2025-01-23 15:02:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 15:02:44,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,253 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,253 INFO L139 ounterexampleChecker]: Examining path program with hash -2048090116, occurence #1 [2025-01-23 15:02:44,253 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1870917749, now seen corresponding path program 1 times [2025-01-23 15:02:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549364351] [2025-01-23 15:02:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-23 15:02:44,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-23 15:02:44,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549364351] [2025-01-23 15:02:44,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549364351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004474566] [2025-01-23 15:02:44,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,335 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 15:02:44,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,367 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,367 INFO L139 ounterexampleChecker]: Examining path program with hash -1206061559, occurence #1 [2025-01-23 15:02:44,367 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,367 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 713193809, now seen corresponding path program 2 times [2025-01-23 15:02:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656646808] [2025-01-23 15:02:44,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 15:02:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:02:44,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:02:44,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 15:02:44,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656646808] [2025-01-23 15:02:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656646808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802710756] [2025-01-23 15:02:44,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,428 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 15:02:44,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,515 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,515 INFO L139 ounterexampleChecker]: Examining path program with hash 2088489681, occurence #1 [2025-01-23 15:02:44,515 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,515 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1164986264, now seen corresponding path program 1 times [2025-01-23 15:02:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386012136] [2025-01-23 15:02:44,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-23 15:02:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-23 15:02:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386012136] [2025-01-23 15:02:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386012136] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990622425] [2025-01-23 15:02:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,545 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 15:02:44,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,642 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,642 INFO L139 ounterexampleChecker]: Examining path program with hash -1232684886, occurence #1 [2025-01-23 15:02:44,642 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,643 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash 470507763, now seen corresponding path program 1 times [2025-01-23 15:02:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236430515] [2025-01-23 15:02:44,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-23 15:02:44,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-23 15:02:44,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236430515] [2025-01-23 15:02:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236430515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278756397] [2025-01-23 15:02:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,667 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:02:44,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 15:02:44,722 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-01-23 15:02:44,723 INFO L319 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/3) [2025-01-23 15:02:44,726 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:44,727 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:02:44,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 15:02:44,727 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@26aa0663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:44,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-23 15:02:44,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-01-23 15:02:44,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-01-23 15:02:44,731 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-01-23 15:02:44,731 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-01-23 15:02:44,732 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:44,733 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 15:02:44,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr2Thread1of1ForFork1 ======== [2025-01-23 15:02:44,733 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@26aa0663, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 15:02:44,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-23 15:02:44,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,742 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,742 INFO L139 ounterexampleChecker]: Examining path program with hash -1575315254, occurence #1 [2025-01-23 15:02:44,742 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,742 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1543836625, now seen corresponding path program 1 times [2025-01-23 15:02:44,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876392447] [2025-01-23 15:02:44,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 15:02:44,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 15:02:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876392447] [2025-01-23 15:02:44,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876392447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 15:02:44,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805316701] [2025-01-23 15:02:44,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,767 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 15:02:44,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,808 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,809 INFO L139 ounterexampleChecker]: Examining path program with hash 76979466, occurence #1 [2025-01-23 15:02:44,809 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,809 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2045547023, now seen corresponding path program 1 times [2025-01-23 15:02:44,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889585063] [2025-01-23 15:02:44,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-23 15:02:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 15:02:44,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889585063] [2025-01-23 15:02:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889585063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67109080] [2025-01-23 15:02:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 15:02:44,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,856 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,856 INFO L139 ounterexampleChecker]: Examining path program with hash 1826195453, occurence #1 [2025-01-23 15:02:44,856 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,856 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,856 INFO L85 PathProgramCache]: Analyzing trace with hash -248202479, now seen corresponding path program 2 times [2025-01-23 15:02:44,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284406639] [2025-01-23 15:02:44,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 15:02:44,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-01-23 15:02:44,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-23 15:02:44,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 15:02:44,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284406639] [2025-01-23 15:02:44,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284406639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749312237] [2025-01-23 15:02:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,893 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) 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) [2025-01-23 15:02:44,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 15:02:44,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:44,929 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:44,929 INFO L139 ounterexampleChecker]: Examining path program with hash 916604533, occurence #1 [2025-01-23 15:02:44,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:44,929 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:44,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash 756092305, now seen corresponding path program 1 times [2025-01-23 15:02:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808816658] [2025-01-23 15:02:44,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 15:02:44,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-23 15:02:44,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-23 15:02:44,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 15:02:44,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808816658] [2025-01-23 15:02:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808816658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:44,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994606151] [2025-01-23 15:02:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:44,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:44,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:44,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:44,952 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:44,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:44,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:44,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-23 15:02:45,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-23 15:02:45,005 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 15:02:45,006 INFO L139 ounterexampleChecker]: Examining path program with hash -1194462578, occurence #1 [2025-01-23 15:02:45,006 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 15:02:45,006 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 15:02:45,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 15:02:45,006 INFO L85 PathProgramCache]: Analyzing trace with hash -343669970, now seen corresponding path program 2 times [2025-01-23 15:02:45,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 15:02:45,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004070601] [2025-01-23 15:02:45,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 15:02:45,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 15:02:45,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-01-23 15:02:45,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-23 15:02:45,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 15:02:45,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 15:02:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 15:02:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 15:02:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004070601] [2025-01-23 15:02:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004070601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 15:02:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 15:02:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 15:02:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274133583] [2025-01-23 15:02:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 15:02:45,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 15:02:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 15:02:45,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 15:02:45,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 15:02:45,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:45,026 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 15:02:45,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 15:02:45,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 15:02:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 15:02:45,061 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-23 15:02:45,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-23 15:02:45,062 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-01-23 15:02:45,062 INFO L319 ceAbstractionStarter]: Result for error location thr2Thread1of1ForFork1 was SAFE (3/3) [2025-01-23 15:02:45,063 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-23 15:02:45,063 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 15:02:45,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-01-23 15:02:45,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 03:02:45 BasicIcfg [2025-01-23 15:02:45,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 15:02:45,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 15:02:45,073 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 15:02:45,074 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 15:02:45,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 03:02:43" (3/4) ... [2025-01-23 15:02:45,075 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-23 15:02:45,077 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2025-01-23 15:02:45,077 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2025-01-23 15:02:45,079 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-01-23 15:02:45,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-01-23 15:02:45,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-23 15:02:45,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-23 15:02:45,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-23 15:02:45,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-23 15:02:45,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 15:02:45,133 INFO L158 Benchmark]: Toolchain (without parser) took 2352.65ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 57.7MB in the beginning and 75.6MB in the end (delta: -17.9MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2025-01-23 15:02:45,133 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 15:02:45,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.74ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 36.3MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-23 15:02:45,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.55ms. Allocated memory is still 83.9MB. Free memory was 36.3MB in the beginning and 34.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 15:02:45,134 INFO L158 Benchmark]: Boogie Preprocessor took 28.25ms. Allocated memory is still 83.9MB. Free memory was 34.7MB in the beginning and 33.7MB in the end (delta: 960.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 15:02:45,134 INFO L158 Benchmark]: RCFGBuilder took 317.05ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 54.5MB in the end (delta: -20.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2025-01-23 15:02:45,134 INFO L158 Benchmark]: TraceAbstraction took 1557.24ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 22.7MB in the end (delta: 31.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2025-01-23 15:02:45,134 INFO L158 Benchmark]: Witness Printer took 59.02ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 22.7MB in the beginning and 75.6MB in the end (delta: -52.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2025-01-23 15:02:45,135 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.19ms. Allocated memory is still 83.9MB. Free memory is still 60.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.74ms. Allocated memory is still 83.9MB. Free memory was 57.7MB in the beginning and 36.3MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.55ms. Allocated memory is still 83.9MB. Free memory was 36.3MB in the beginning and 34.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.25ms. Allocated memory is still 83.9MB. Free memory was 34.7MB in the beginning and 33.7MB in the end (delta: 960.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.05ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 54.5MB in the end (delta: -20.8MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1557.24ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 22.7MB in the end (delta: 31.2MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Witness Printer took 59.02ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 22.7MB in the beginning and 75.6MB in the end (delta: -52.9MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 393, dependent conditional: 365, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1682, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 92, dependent conditional: 64, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1682, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 92, dependent conditional: 64, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 224, dependent conditional: 196, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 4, independent unconditional: 1586, dependent: 224, dependent conditional: 36, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 4, independent unconditional: 1586, dependent: 224, dependent conditional: 36, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 735, independent: 699, independent conditional: 2, independent unconditional: 697, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 735, independent: 676, independent conditional: 0, independent unconditional: 676, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 59, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, independent: 131, independent conditional: 9, independent unconditional: 122, dependent: 206, dependent conditional: 29, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1814, independent: 891, independent conditional: 2, independent unconditional: 889, dependent: 188, dependent conditional: 28, dependent unconditional: 160, unknown: 735, unknown conditional: 10, unknown unconditional: 725] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 699, Positive conditional cache size: 2, Positive unconditional cache size: 697, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1001, Maximal queried relation: 4, Independence queries for same thread: 301, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 172, Number of trivial persistent sets: 155, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 773, independent: 745, independent conditional: 0, independent unconditional: 745, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 393, dependent conditional: 365, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1682, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 92, dependent conditional: 64, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1682, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 92, dependent conditional: 64, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 845, independent unconditional: 745, dependent: 224, dependent conditional: 196, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 4, independent unconditional: 1586, dependent: 224, dependent conditional: 36, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1814, independent: 1590, independent conditional: 4, independent unconditional: 1586, dependent: 224, dependent conditional: 36, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 735, independent: 699, independent conditional: 2, independent unconditional: 697, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 735, independent: 676, independent conditional: 0, independent unconditional: 676, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 59, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 59, independent: 23, independent conditional: 2, independent unconditional: 21, dependent: 36, dependent conditional: 8, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 337, independent: 131, independent conditional: 9, independent unconditional: 122, dependent: 206, dependent conditional: 29, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1814, independent: 891, independent conditional: 2, independent unconditional: 889, dependent: 188, dependent conditional: 28, dependent unconditional: 160, unknown: 735, unknown conditional: 10, unknown unconditional: 725] , Statistics on independence cache: Total cache size (in pairs): 735, Positive cache size: 699, Positive conditional cache size: 2, Positive unconditional cache size: 697, Negative cache size: 36, Negative conditional cache size: 8, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1001, Maximal queried relation: 4, Independence queries for same thread: 301 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 167, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 165, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 700, Positive conditional cache size: 0, Positive unconditional cache size: 700, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 2, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 8, Number of trivial persistent sets: 6, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 159, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 167, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 6, independent unconditional: 155, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 161, independent conditional: 0, independent unconditional: 161, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 165, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 700, Positive conditional cache size: 0, Positive unconditional cache size: 700, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2337, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 485, dependent conditional: 457, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1963, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 111, dependent conditional: 83, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1963, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 111, dependent conditional: 83, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 268, dependent conditional: 240, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 6, independent unconditional: 1846, dependent: 268, dependent conditional: 49, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 6, independent unconditional: 1846, dependent: 268, dependent conditional: 49, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 2, independent unconditional: 103, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 27, dependent conditional: 25, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2120, independent: 1747, independent conditional: 4, independent unconditional: 1743, dependent: 255, dependent conditional: 39, dependent unconditional: 216, unknown: 118, unknown conditional: 12, unknown unconditional: 106] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 805, Positive conditional cache size: 2, Positive unconditional cache size: 803, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1323, Maximal queried relation: 3, Independence queries for same thread: 374, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 201, Number of trivial persistent sets: 174, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 742, independent: 714, independent conditional: 0, independent unconditional: 714, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2337, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 485, dependent conditional: 457, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1963, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 111, dependent conditional: 83, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1963, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 111, dependent conditional: 83, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 1138, independent unconditional: 714, dependent: 268, dependent conditional: 240, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 6, independent unconditional: 1846, dependent: 268, dependent conditional: 49, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2120, independent: 1852, independent conditional: 6, independent unconditional: 1846, dependent: 268, dependent conditional: 49, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 2, independent unconditional: 103, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 118, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 19, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 13, dependent conditional: 10, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 27, dependent conditional: 25, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2120, independent: 1747, independent conditional: 4, independent unconditional: 1743, dependent: 255, dependent conditional: 39, dependent unconditional: 216, unknown: 118, unknown conditional: 12, unknown unconditional: 106] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 805, Positive conditional cache size: 2, Positive unconditional cache size: 803, Negative cache size: 41, Negative conditional cache size: 10, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1323, Maximal queried relation: 3, Independence queries for same thread: 374 - PositiveResult [Line: 759]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 774]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 67 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 67 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thr2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 67 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-23 15:02:45,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE