/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 12:07:44,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 12:07:45,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 12:07:45,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 12:07:45,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 12:07:45,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 12:07:45,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 12:07:45,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 12:07:45,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 12:07:45,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 12:07:45,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 12:07:45,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 12:07:45,080 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 12:07:45,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 12:07:45,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:07:45,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:07:45,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:07:45,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 12:07:45,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 12:07:45,087 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 12:07:45,087 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 12:07:45,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 12:07:45,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 12:07:45,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 12:07:45,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 12:07:45,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 12:07:45,549 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 12:07:45,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-04-14 12:07:47,221 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8eda27/577e0c0cdfec4e8885f78af31ef6c00f/FLAG5f2f9a149 [2025-04-14 12:07:47,559 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 12:07:47,560 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-04-14 12:07:47,574 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8eda27/577e0c0cdfec4e8885f78af31ef6c00f/FLAG5f2f9a149 [2025-04-14 12:07:48,285 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89a8eda27/577e0c0cdfec4e8885f78af31ef6c00f [2025-04-14 12:07:48,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 12:07:48,290 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 12:07:48,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 12:07:48,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 12:07:48,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 12:07:48,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:07:48" (1/1) ... [2025-04-14 12:07:48,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4198cde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:48, skipping insertion in model container [2025-04-14 12:07:48,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:07:48" (1/1) ... [2025-04-14 12:07:48,334 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 12:07:48,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i[47038,47051] [2025-04-14 12:07:48,896 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:48,897 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:48,897 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:48,898 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:48,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:07:48,986 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 12:07:49,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i[47038,47051] [2025-04-14 12:07:49,060 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:49,061 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:49,061 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:49,061 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 12:07:49,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 12:07:49,125 INFO L204 MainTranslator]: Completed translation [2025-04-14 12:07:49,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49 WrapperNode [2025-04-14 12:07:49,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 12:07:49,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 12:07:49,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 12:07:49,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 12:07:49,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,182 INFO L138 Inliner]: procedures = 280, calls = 142, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 354 [2025-04-14 12:07:49,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 12:07:49,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 12:07:49,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 12:07:49,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 12:07:49,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 12:07:49,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 12:07:49,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 12:07:49,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 12:07:49,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (1/1) ... [2025-04-14 12:07:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 12:07:49,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:07:49,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 12:07:49,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 12:07:49,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-04-14 12:07:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-14 12:07:49,314 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 12:07:49,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 12:07:49,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 12:07:49,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 12:07:49,316 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 12:07:49,477 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 12:07:49,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 12:07:49,955 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 12:07:49,955 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 12:07:50,437 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 12:07:50,437 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-04-14 12:07:50,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:07:50 BoogieIcfgContainer [2025-04-14 12:07:50,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 12:07:50,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 12:07:50,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 12:07:50,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 12:07:50,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:07:48" (1/3) ... [2025-04-14 12:07:50,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7ed992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:07:50, skipping insertion in model container [2025-04-14 12:07:50,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:07:49" (2/3) ... [2025-04-14 12:07:50,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7ed992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:07:50, skipping insertion in model container [2025-04-14 12:07:50,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 12:07:50" (3/3) ... [2025-04-14 12:07:50,449 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-04-14 12:07:50,462 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 12:07:50,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 82 locations, 113 edges, 1 initial locations, 20 loop locations, and 2 error locations. [2025-04-14 12:07:50,465 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 12:07:50,526 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 12:07:50,563 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:07:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 12:07:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:07:50,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 12:07:50,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 12:07:50,649 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:07:50,663 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2025-04-14 12:07:50,671 INFO L340 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;@16d36231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:07:50,671 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 12:07:52,720 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:52,720 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:52,721 INFO L139 ounterexampleChecker]: Examining path program with hash -404708422, occurence #1 [2025-04-14 12:07:52,721 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:07:52,721 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:52,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1128499273, now seen corresponding path program 1 times [2025-04-14 12:07:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:52,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164862937] [2025-04-14 12:07:52,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:52,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:52,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-04-14 12:07:52,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-04-14 12:07:52,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:52,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:53,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164862937] [2025-04-14 12:07:53,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164862937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:07:53,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:07:53,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 12:07:53,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323174361] [2025-04-14 12:07:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:07:53,226 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:07:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:53,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:07:53,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:07:53,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:53,240 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:53,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:07:53,243 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:53,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:53,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 12:07:53,547 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:53,547 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:53,547 INFO L139 ounterexampleChecker]: Examining path program with hash -848794211, occurence #1 [2025-04-14 12:07:53,547 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:07:53,547 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:53,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1691627087, now seen corresponding path program 1 times [2025-04-14 12:07:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:53,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892381826] [2025-04-14 12:07:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:53,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-04-14 12:07:53,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-04-14 12:07:53,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:53,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:53,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:53,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:53,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892381826] [2025-04-14 12:07:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892381826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:07:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:07:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 12:07:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858787335] [2025-04-14 12:07:53,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:07:53,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:07:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:53,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:07:53,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:07:53,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:53,736 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:53,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:07:53,737 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:53,737 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:53,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:53,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:53,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 12:07:53,901 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:53,901 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:53,901 INFO L139 ounterexampleChecker]: Examining path program with hash -848794211, occurence #2 [2025-04-14 12:07:53,901 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:07:53,902 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:07:53,902 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:53,902 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 12:07:53,902 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:53,902 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 12:07:53,902 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:53,902 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 12:07:53,902 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:07:53,902 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 12:07:53,903 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:07:53,903 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 41 [2025-04-14 12:07:53,903 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:53,903 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 50 [2025-04-14 12:07:53,946 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:53,946 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:53,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1553044208, now seen corresponding path program 1 times [2025-04-14 12:07:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:53,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736239807] [2025-04-14 12:07:53,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:53,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-14 12:07:53,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-14 12:07:53,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:53,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,084 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:54,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736239807] [2025-04-14 12:07:54,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736239807] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1319709135] [2025-04-14 12:07:54,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-14 12:07:54,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-14 12:07:54,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:54,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1319709135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 12:07:54,166 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:54,166 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 12:07:54,166 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,166 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2025-04-14 12:07:54,166 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,166 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 73 [2025-04-14 12:07:54,191 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_4 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:54,192 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:54,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash -159665842, now seen corresponding path program 1 times [2025-04-14 12:07:54,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:54,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875088909] [2025-04-14 12:07:54,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 12:07:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 12:07:54,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,297 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:54,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875088909] [2025-04-14 12:07:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875088909] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1859291298] [2025-04-14 12:07:54,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-14 12:07:54,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-14 12:07:54,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:54,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1859291298] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 12:07:54,366 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:54,366 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 85 [2025-04-14 12:07:54,366 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,366 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 86 [2025-04-14 12:07:54,366 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,366 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-14 12:07:54,366 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,366 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 108 [2025-04-14 12:07:54,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:54,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1607014532, now seen corresponding path program 1 times [2025-04-14 12:07:54,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:54,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687809430] [2025-04-14 12:07:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 12:07:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 12:07:54,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,556 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:54,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687809430] [2025-04-14 12:07:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687809430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1833975072] [2025-04-14 12:07:54,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 12:07:54,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 12:07:54,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:54,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1833975072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:54,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 12:07:54,629 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:54,629 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111 [2025-04-14 12:07:54,629 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,629 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 113 [2025-04-14 12:07:54,663 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_6 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:54,663 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_5 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:54,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1481638873, now seen corresponding path program 1 times [2025-04-14 12:07:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:54,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53575272] [2025-04-14 12:07:54,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-14 12:07:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-14 12:07:54,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,812 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:54,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53575272] [2025-04-14 12:07:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53575272] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [83374471] [2025-04-14 12:07:54,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-14 12:07:54,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-14 12:07:54,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:54,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:54,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:54,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [83374471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:54,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:54,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 12:07:54,883 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:54,883 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 117 [2025-04-14 12:07:54,883 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,883 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 121 [2025-04-14 12:07:54,883 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:54,883 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:07:54,883 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:54,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash 51829066, now seen corresponding path program 1 times [2025-04-14 12:07:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:54,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238576583] [2025-04-14 12:07:54,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:54,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-14 12:07:54,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-14 12:07:54,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:54,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:55,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238576583] [2025-04-14 12:07:55,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238576583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:55,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341468359] [2025-04-14 12:07:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:55,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:07:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:07:55,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:07:55,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 12:07:55,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-14 12:07:55,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-14 12:07:55,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:55,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:55,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:55,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:55,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:07:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341468359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:07:55,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:07:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 12:07:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810669449] [2025-04-14 12:07:55,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:07:55,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 12:07:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:55,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 12:07:55,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 12:07:55,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:55,349 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:55,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:07:55,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:55,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:55,349 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:55,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:55,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:55,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:07:55,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 12:07:55,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2025-04-14 12:07:55,867 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:55,867 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:55,867 INFO L139 ounterexampleChecker]: Examining path program with hash -848794211, occurence #3 [2025-04-14 12:07:55,868 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:07:55,868 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 12:07:55,868 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 12:07:55,868 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 12:07:55,868 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 12:07:55,868 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-04-14 12:07:55,868 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:55,868 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 12:07:55,903 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_8 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:55,903 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_7 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:55,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:55,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1725787465, now seen corresponding path program 1 times [2025-04-14 12:07:55,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:55,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113384428] [2025-04-14 12:07:55,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:55,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-14 12:07:55,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 12:07:55,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:55,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,052 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:56,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113384428] [2025-04-14 12:07:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113384428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1754571791] [2025-04-14 12:07:56,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-14 12:07:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 12:07:56,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:56,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1754571791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:56,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 12:07:56,141 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:56,141 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-14 12:07:56,141 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,141 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 66 [2025-04-14 12:07:56,141 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,142 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 76 [2025-04-14 12:07:56,167 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_9 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:56,167 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_10 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:56,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1528861345, now seen corresponding path program 1 times [2025-04-14 12:07:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:56,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745786332] [2025-04-14 12:07:56,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-14 12:07:56,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-14 12:07:56,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,313 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:56,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745786332] [2025-04-14 12:07:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745786332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1414991661] [2025-04-14 12:07:56,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-04-14 12:07:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-04-14 12:07:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:56,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1414991661] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 12:07:56,433 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:56,433 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 88 [2025-04-14 12:07:56,433 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,433 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 12:07:56,433 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,433 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 90 [2025-04-14 12:07:56,433 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,433 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111 [2025-04-14 12:07:56,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1898444395, now seen corresponding path program 1 times [2025-04-14 12:07:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:56,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934729009] [2025-04-14 12:07:56,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-14 12:07:56,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-14 12:07:56,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,628 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:56,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934729009] [2025-04-14 12:07:56,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934729009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1660978856] [2025-04-14 12:07:56,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-14 12:07:56,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-14 12:07:56,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:56,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1660978856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:56,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 12:07:56,754 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:56,754 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 114 [2025-04-14 12:07:56,754 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:56,754 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 116 [2025-04-14 12:07:56,782 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_11 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:56,782 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_12 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 12:07:56,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 107517674, now seen corresponding path program 1 times [2025-04-14 12:07:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 12:07:56,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231302515] [2025-04-14 12:07:56,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:56,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-14 12:07:56,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-14 12:07:56,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:56,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:56,945 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 12:07:56,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231302515] [2025-04-14 12:07:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231302515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:56,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1110193449] [2025-04-14 12:07:56,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:56,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:57,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-14 12:07:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-14 12:07:57,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:57,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:57,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:07:57,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:07:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:07:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1110193449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:57,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 12:07:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 12:07:57,074 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 12:07:57,074 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 120 [2025-04-14 12:07:57,074 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:57,074 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 124 [2025-04-14 12:07:57,074 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:57,074 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:07:57,074 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:57,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 899978511, now seen corresponding path program 2 times [2025-04-14 12:07:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:57,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217916998] [2025-04-14 12:07:57,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:07:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:57,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-04-14 12:07:57,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 129 of 135 statements. [2025-04-14 12:07:57,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 12:07:57,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 12:07:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:57,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217916998] [2025-04-14 12:07:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217916998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:07:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:07:57,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 12:07:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311667717] [2025-04-14 12:07:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:07:57,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 12:07:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:57,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 12:07:57,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 12:07:57,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:57,209 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:57,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:07:57,214 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:57,214 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:57,214 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:07:57,214 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:58,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:58,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:58,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:07:58,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 12:07:58,879 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 12:07:58,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2025-04-14 12:07:58,891 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-14 12:07:58,892 INFO L320 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE (1/3) [2025-04-14 12:07:58,904 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:07:58,908 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 12:07:58,908 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork0 ======== [2025-04-14 12:07:58,908 INFO L340 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;@16d36231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 12:07:58,909 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 12:07:58,928 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:58,929 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:58,929 INFO L139 ounterexampleChecker]: Examining path program with hash 1193466870, occurence #1 [2025-04-14 12:07:58,929 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:07:58,929 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:58,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash -971341980, now seen corresponding path program 1 times [2025-04-14 12:07:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:58,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019133903] [2025-04-14 12:07:58,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:58,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:58,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 12:07:58,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 12:07:58,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:58,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:59,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019133903] [2025-04-14 12:07:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019133903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:07:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:07:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 12:07:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619264850] [2025-04-14 12:07:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:07:59,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:07:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:59,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:07:59,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:07:59,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:59,017 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:59,017 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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-04-14 12:07:59,017 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:59,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:59,244 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 12:07:59,245 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:59,245 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:59,245 INFO L139 ounterexampleChecker]: Examining path program with hash -1892988587, occurence #1 [2025-04-14 12:07:59,245 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 12:07:59,245 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:59,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -2060108832, now seen corresponding path program 1 times [2025-04-14 12:07:59,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:59,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553853582] [2025-04-14 12:07:59,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:59,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 12:07:59,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 12:07:59,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:59,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:59,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553853582] [2025-04-14 12:07:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553853582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 12:07:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 12:07:59,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 12:07:59,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756147719] [2025-04-14 12:07:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 12:07:59,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 12:07:59,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:07:59,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 12:07:59,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 12:07:59,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:59,343 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:07:59,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:07:59,343 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:59,343 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:07:59,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:59,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:07:59,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 12:07:59,645 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:07:59,645 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:07:59,645 INFO L139 ounterexampleChecker]: Examining path program with hash -1892988587, occurence #2 [2025-04-14 12:07:59,645 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:07:59,645 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:07:59,646 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:59,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 12:07:59,646 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:59,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 12:07:59,646 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:07:59,646 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 12:07:59,646 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:07:59,646 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:07:59,646 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:07:59,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:07:59,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2008012357, now seen corresponding path program 1 times [2025-04-14 12:07:59,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:07:59,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594796866] [2025-04-14 12:07:59,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:07:59,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 12:07:59,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 12:07:59,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:07:59,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:07:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:07:59,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:07:59,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594796866] [2025-04-14 12:07:59,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594796866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:07:59,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499687648] [2025-04-14 12:07:59,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 12:07:59,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:07:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:07:59,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:07:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 12:08:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 12:08:00,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 12:08:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 12:08:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:08:00,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 12:08:00,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:08:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:08:00,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:08:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:08:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499687648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:08:00,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:08:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 12:08:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30448133] [2025-04-14 12:08:00,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:08:00,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 12:08:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:08:00,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 12:08:00,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 12:08:00,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:08:00,303 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:08:00,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-04-14 12:08:00,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:00,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:00,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:08:00,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:00,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:00,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:08:00,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 12:08:00,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:08:00,966 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:08:00,966 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:08:00,967 INFO L139 ounterexampleChecker]: Examining path program with hash -1892988587, occurence #3 [2025-04-14 12:08:00,967 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:08:00,967 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:08:00,967 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:00,967 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 12:08:00,968 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:00,968 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 12:08:00,968 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:00,968 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 12:08:00,968 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:08:00,968 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:08:00,968 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:08:00,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:08:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1673843424, now seen corresponding path program 2 times [2025-04-14 12:08:00,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:08:00,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255035533] [2025-04-14 12:08:00,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:08:00,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:08:01,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 12:08:01,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 12:08:01,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:08:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:08:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 12:08:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:08:01,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255035533] [2025-04-14 12:08:01,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255035533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:08:01,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024407486] [2025-04-14 12:08:01,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 12:08:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:08:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:08:01,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:08:01,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 12:08:01,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 12:08:01,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 12:08:01,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 12:08:01,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:08:01,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 12:08:01,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 12:08:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:08:01,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 12:08:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 12:08:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024407486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 12:08:01,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 12:08:01,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-04-14 12:08:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134466483] [2025-04-14 12:08:01,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 12:08:01,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 12:08:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:08:01,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 12:08:01,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-04-14 12:08:01,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:08:01,666 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:08:01,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 0 states have call successors, (0), 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-04-14 12:08:01,666 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:01,666 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:01,666 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:08:01,666 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:08:02,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:02,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:08:02,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:08:02,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 12:08:02,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 12:08:02,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:08:02,921 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 12:08:02,921 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 12:08:02,922 INFO L139 ounterexampleChecker]: Examining path program with hash -1892988587, occurence #4 [2025-04-14 12:08:02,922 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 12:08:02,922 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 12:08:02,922 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 12:08:02,922 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 12:08:02,922 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 12:08:02,922 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 12:08:02,922 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 12:08:02,922 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 12:08:02,922 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 12:08:02,922 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 12:08:02,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 12:08:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1006941028, now seen corresponding path program 3 times [2025-04-14 12:08:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 12:08:02,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923099017] [2025-04-14 12:08:02,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:08:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 12:08:03,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 13 equivalence classes. [2025-04-14 12:08:17,297 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 42 of 42 statements. [2025-04-14 12:08:17,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-04-14 12:08:17,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 12:08:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 123 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-14 12:08:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 12:08:18,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923099017] [2025-04-14 12:08:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923099017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 12:08:18,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755927940] [2025-04-14 12:08:18,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 12:08:18,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 12:08:18,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 12:08:18,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 12:08:18,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 12:08:18,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 13 equivalence classes. Received shutdown request... [2025-04-14 12:22:26,018 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:22:26,030 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:22:26,031 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 12:22:27,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 12:22:27,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2025-04-14 12:22:27,234 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-14 12:22:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-14 12:22:27,301 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 12:22:27,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 12:22:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-04-14 12:22:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481364852] [2025-04-14 12:22:27,301 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 12:22:27,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 12:22:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 12:22:27,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 12:22:27,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 12:22:27,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:22:27,302 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 12:22:27,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 12:22:27,302 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:22:27,302 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 12:22:27,302 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 12:22:27,302 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-14 12:22:27,302 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 12:22:27,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 12:22:27,303 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 12:22:27,303 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 12:22:27,304 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-14 12:22:27,304 INFO L320 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork0 was TIMEOUT (2/3) [2025-04-14 12:22:27,305 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 12:22:27,305 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 12:22:27,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:22:27 BasicIcfg [2025-04-14 12:22:27,307 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 12:22:27,307 INFO L158 Benchmark]: Toolchain (without parser) took 879017.74ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 100.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 435.2MB. Max. memory is 8.0GB. [2025-04-14 12:22:27,307 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:22:27,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.01ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 63.5MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 12:22:27,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.31ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 59.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 12:22:27,308 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 56.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 12:22:27,308 INFO L158 Benchmark]: RCFGBuilder took 1212.56ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 86.8MB in the end (delta: -30.2MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2025-04-14 12:22:27,308 INFO L158 Benchmark]: TraceAbstraction took 876867.86ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 86.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 421.0MB. Max. memory is 8.0GB. [2025-04-14 12:22:27,309 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.40ms. Allocated memory is still 159.4MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 834.01ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 63.5MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.31ms. Allocated memory is still 142.6MB. Free memory was 63.5MB in the beginning and 59.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 56.7MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1212.56ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 86.8MB in the end (delta: -30.2MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 876867.86ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 86.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 421.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10896, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 882, dependent conditional: 790, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10162, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 148, dependent conditional: 56, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10162, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 148, dependent conditional: 56, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 192, dependent conditional: 100, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 0, independent unconditional: 10014, dependent: 192, dependent conditional: 6, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 0, independent unconditional: 10014, dependent: 192, dependent conditional: 6, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5035, independent: 4937, independent conditional: 0, independent unconditional: 4937, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5035, independent: 4904, independent conditional: 0, independent unconditional: 4904, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 131, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 131, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3126, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 2777, dependent conditional: 573, dependent unconditional: 2204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10206, independent: 5077, independent conditional: 0, independent unconditional: 5077, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 5035, unknown conditional: 6, unknown unconditional: 5029] , Statistics on independence cache: Total cache size (in pairs): 5043, Positive cache size: 4945, Positive conditional cache size: 8, Positive unconditional cache size: 4937, Negative cache size: 98, Negative conditional cache size: 6, Negative unconditional cache size: 92, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1807, Maximal queried relation: 1, Independence queries for same thread: 734, Persistent sets #1 benchmarks: Persistent set computation time: 2.7s, Number of persistent set computation: 299, Number of trivial persistent sets: 266, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8393, independent: 8301, independent conditional: 0, independent unconditional: 8301, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10896, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 882, dependent conditional: 790, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10162, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 148, dependent conditional: 56, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10162, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 148, dependent conditional: 56, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 1713, independent unconditional: 8301, dependent: 192, dependent conditional: 100, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 0, independent unconditional: 10014, dependent: 192, dependent conditional: 6, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10206, independent: 10014, independent conditional: 0, independent unconditional: 10014, dependent: 192, dependent conditional: 6, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5035, independent: 4937, independent conditional: 0, independent unconditional: 4937, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5035, independent: 4904, independent conditional: 0, independent unconditional: 4904, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 131, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 131, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 98, dependent conditional: 6, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3126, independent: 349, independent conditional: 0, independent unconditional: 349, dependent: 2777, dependent conditional: 573, dependent unconditional: 2204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 8, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10206, independent: 5077, independent conditional: 0, independent unconditional: 5077, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 5035, unknown conditional: 6, unknown unconditional: 5029] , Statistics on independence cache: Total cache size (in pairs): 5043, Positive cache size: 4945, Positive conditional cache size: 8, Positive unconditional cache size: 4937, Negative cache size: 98, Negative conditional cache size: 6, Negative unconditional cache size: 92, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1807, Maximal queried relation: 1, Independence queries for same thread: 734 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1049, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 167, dependent conditional: 157, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 897, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 897, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 901, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 19, dependent conditional: 9, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5029, Positive cache size: 4937, Positive conditional cache size: 0, Positive unconditional cache size: 4937, Negative cache size: 92, Negative conditional cache size: 0, Negative unconditional cache size: 92, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 1, Independence queries for same thread: 152, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 38, Number of trivial persistent sets: 37, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 809, independent: 799, independent conditional: 0, independent unconditional: 799, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1049, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 167, dependent conditional: 157, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 897, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 897, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 15, dependent conditional: 5, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 901, independent: 882, independent conditional: 83, independent unconditional: 799, dependent: 19, dependent conditional: 9, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 901, independent: 882, independent conditional: 0, independent unconditional: 882, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5029, Positive cache size: 4937, Positive conditional cache size: 0, Positive unconditional cache size: 4937, Negative cache size: 92, Negative conditional cache size: 0, Negative unconditional cache size: 92, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 1, Independence queries for same thread: 152 - PositiveResult [Line: 999]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2_funThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 150 locations, 213 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 4.5s, 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: 16, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 686 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 812 ConstructedInterpolants, 0 QuantifiedInterpolants, 844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 975 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 15/18 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]: 2183, ConditionCalculationTime [ms]: 251, ConditionCalculations: 32, QuantifiedConditions: 0, TraceChecks: 8, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 8 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1_funThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 150 locations, 213 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 868.4s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.1s, 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: 39, 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.1s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1153 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 195/274 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: 11, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown