./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:34:36,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:34:36,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:34:36,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:34:36,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:34:36,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:34:36,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:34:36,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:34:36,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:34:36,675 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:34:36,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:34:36,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:34:36,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:34:36,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:34:36,677 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:34:36,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:34:36,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:34:36,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:34:36,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:34:36,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:36,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:34:36,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:34:36,680 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:34:36,681 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2025-02-05 14:34:36,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:34:36,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:34:36,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:34:36,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:34:36,993 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:34:36,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2025-02-05 14:34:38,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23bbe9fb2/480cfc4cf47c405c9acd2a0552aa7b41/FLAGddae08454 [2025-02-05 14:34:39,262 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:34:39,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2025-02-05 14:34:39,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23bbe9fb2/480cfc4cf47c405c9acd2a0552aa7b41/FLAGddae08454 [2025-02-05 14:34:39,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/23bbe9fb2/480cfc4cf47c405c9acd2a0552aa7b41 [2025-02-05 14:34:39,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:34:39,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:34:39,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:39,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:34:39,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:34:39,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785c1ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39, skipping insertion in model container [2025-02-05 14:34:39,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:34:39,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2025-02-05 14:34:39,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2025-02-05 14:34:39,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2025-02-05 14:34:39,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2025-02-05 14:34:39,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2025-02-05 14:34:39,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2025-02-05 14:34:39,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:39,585 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:34:39,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22384,22397] [2025-02-05 14:34:39,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22614,22627] [2025-02-05 14:34:39,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[22989,23002] [2025-02-05 14:34:39,644 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23053,23066] [2025-02-05 14:34:39,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23184,23197] [2025-02-05 14:34:39,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i[23248,23261] [2025-02-05 14:34:39,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:34:39,681 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:34:39,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39 WrapperNode [2025-02-05 14:34:39,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:34:39,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:39,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:34:39,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:34:39,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,723 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 180 [2025-02-05 14:34:39,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:34:39,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:34:39,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:34:39,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:34:39,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,764 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2025-02-05 14:34:39,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:34:39,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:34:39,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:34:39,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:34:39,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (1/1) ... [2025-02-05 14:34:39,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:34:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:34:39,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:34:39,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:34:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 14:34:39,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:34:39,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:34:39,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:34:39,954 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:34:39,955 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:34:40,213 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-05 14:34:40,214 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:34:40,230 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:34:40,232 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:34:40,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:40 BoogieIcfgContainer [2025-02-05 14:34:40,232 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:34:40,235 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:34:40,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:34:40,239 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:34:40,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:34:39" (1/3) ... [2025-02-05 14:34:40,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c6dee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:40, skipping insertion in model container [2025-02-05 14:34:40,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:34:39" (2/3) ... [2025-02-05 14:34:40,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c6dee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:34:40, skipping insertion in model container [2025-02-05 14:34:40,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:40" (3/3) ... [2025-02-05 14:34:40,243 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2025-02-05 14:34:40,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:34:40,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-sorted-1.i that has 1 procedures, 57 locations, 1 initial locations, 12 loop locations, and 6 error locations. [2025-02-05 14:34:40,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:34:40,327 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@5bbba1a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:34:40,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-05 14:34:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 50 states have (on average 1.8) internal successors, (90), 56 states have internal predecessors, (90), 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-02-05 14:34:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:34:40,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:40,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:40,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:40,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash 475101756, now seen corresponding path program 1 times [2025-02-05 14:34:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235024045] [2025-02-05 14:34:40,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:40,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:34:40,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:34:40,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:40,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235024045] [2025-02-05 14:34:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235024045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 14:34:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860936023] [2025-02-05 14:34:40,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:40,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 14:34:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:40,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 14:34:40,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:40,554 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.8) internal successors, (90), 56 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-05 14:34:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:40,569 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2025-02-05 14:34:40,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 14:34:40,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 14:34:40,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:40,575 INFO L225 Difference]: With dead ends: 108 [2025-02-05 14:34:40,576 INFO L226 Difference]: Without dead ends: 53 [2025-02-05 14:34:40,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 14:34:40,580 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:40,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:34:40,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-05 14:34:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-05 14:34:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2025-02-05 14:34:40,609 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 7 [2025-02-05 14:34:40,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2025-02-05 14:34:40,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-02-05 14:34:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2025-02-05 14:34:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:34:40,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:40,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:40,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:34:40,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1821149659, now seen corresponding path program 1 times [2025-02-05 14:34:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984713914] [2025-02-05 14:34:40,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:40,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:40,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:34:40,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:34:40,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:40,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:34:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984713914] [2025-02-05 14:34:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984713914] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:40,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:40,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 14:34:40,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502097321] [2025-02-05 14:34:40,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:40,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 14:34:40,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:40,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 14:34:40,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:34:40,706 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-05 14:34:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:40,757 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2025-02-05 14:34:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 14:34:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 14:34:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:40,758 INFO L225 Difference]: With dead ends: 112 [2025-02-05 14:34:40,758 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 14:34:40,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 14:34:40,760 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:40,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:34:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 14:34:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-02-05 14:34:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:34:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-02-05 14:34:40,766 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 8 [2025-02-05 14:34:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:40,767 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-02-05 14:34:40,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-05 14:34:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-02-05 14:34:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 14:34:40,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:40,767 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:40,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:34:40,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:40,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1590217496, now seen corresponding path program 1 times [2025-02-05 14:34:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448616621] [2025-02-05 14:34:40,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:40,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 14:34:40,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 14:34:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:34:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 14:34:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:34:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448616621] [2025-02-05 14:34:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448616621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:34:40,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:34:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:34:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556485763] [2025-02-05 14:34:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:34:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:34:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:34:40,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:34:40,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:34:40,970 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-05 14:34:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:34:41,100 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2025-02-05 14:34:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:34:41,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 14:34:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:34:41,104 INFO L225 Difference]: With dead ends: 91 [2025-02-05 14:34:41,104 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 14:34:41,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:34:41,105 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 139 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:34:41,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 70 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:34:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 14:34:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2025-02-05 14:34:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 54 states have internal predecessors, (66), 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-02-05 14:34:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-05 14:34:41,112 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 12 [2025-02-05 14:34:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:34:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-05 14:34:41,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-05 14:34:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-05 14:34:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 14:34:41,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:34:41,114 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:34:41,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:34:41,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-05 14:34:41,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:34:41,115 INFO L85 PathProgramCache]: Analyzing trace with hash 906086473, now seen corresponding path program 1 times [2025-02-05 14:34:41,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:34:41,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868726763] [2025-02-05 14:34:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:34:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:34:41,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:34:41,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:34:41,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:41,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:34:41,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:34:41,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 14:34:41,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 14:34:41,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:34:41,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:34:41,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:34:41,257 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:34:41,258 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-02-05 14:34:41,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-05 14:34:41,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-05 14:34:41,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-05 14:34:41,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-05 14:34:41,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-05 14:34:41,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:34:41,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-05 14:34:41,293 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:34:41,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:34:41 BoogieIcfgContainer [2025-02-05 14:34:41,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:34:41,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:34:41,297 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:34:41,297 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:34:41,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:34:40" (3/4) ... [2025-02-05 14:34:41,299 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 14:34:41,347 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 16. [2025-02-05 14:34:41,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:34:41,406 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:34:41,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:34:41,408 INFO L158 Benchmark]: Toolchain (without parser) took 2115.83ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 63.1MB in the end (delta: 42.3MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-02-05 14:34:41,408 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.93ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 87.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.31ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: Boogie Preprocessor took 49.56ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: IcfgBuilder took 455.72ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 63.8MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: TraceAbstraction took 1062.19ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 69.0MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:41,409 INFO L158 Benchmark]: Witness Printer took 109.01ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 63.1MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:34:41,411 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.22ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.93ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 87.4MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.31ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.56ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 455.72ms. Allocated memory is still 142.6MB. Free memory was 83.4MB in the beginning and 63.8MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1062.19ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 69.0MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 109.01ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 63.1MB in the end (delta: 5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1038]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] head->data = 0 [L1002] SLL* x = head; [L1003] int marked = 0; VAL [head={-1:0}, marked=0, x={-1:0}] [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1009] x->next = malloc(sizeof(SLL)) [L1010] EXPR x->next [L1010] x->next->prev = x [L1011] EXPR x->next [L1011] x = x->next [L1012] x->next = ((void*)0) [L1014] COND TRUE __VERIFIER_nondet_int() [L1016] marked = 1 VAL [head={-1:0}, marked=1, x={-2:0}] [L1019] COND TRUE \read(marked) [L1020] x->data = 1 [L1006] COND TRUE __VERIFIER_nondet_int() || !marked [L1006] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1025] x = head VAL [head={-1:0}, x={-1:0}] [L1027] COND TRUE 0 VAL [head={-1:0}, x={-1:0}] [L1027] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, x={-1:0}] [L1027] COND FALSE !(0) VAL [head={-1:0}, x={-1:0}] [L1028] marked = 0 VAL [head={-1:0}, x={-1:0}] [L1030] COND TRUE x->next != ((void*)0) && x->next->data == 0 [L1030] EXPR x->next [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, x={-1:0}] [L1030] x->next != ((void*)0) && x->next->data == 0 [L1030] EXPR x->next [L1030] EXPR x->next->data [L1030] x->next != ((void*)0) && x->next->data == 0 VAL [head={-1:0}, x={-1:0}] [L1030] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] EXPR x->next [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] x->next != ((void*)0) && __VERIFIER_nondet_int() VAL [head={-1:0}, x={-1:0}] [L1035] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1037] EXPR x->next [L1037] x = x->next [L1038] COND TRUE 0 [L1038] EXPR x->data [L1038] COND TRUE !(x->data != 1) [L1038] reach_error() VAL [head={-1:0}, x={-2:0}] - UnprovableResult [Line: 1070]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1069]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 175 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 38 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-05 14:34:41,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE