./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/aws-c-common/aws_linked_list_rend_harness_negated.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:54:04,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:54:04,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:54:04,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:54:04,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:54:04,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:54:04,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:54:04,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:54:04,112 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:54:04,112 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:54:04,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:54:04,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:54:04,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:54:04,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:54:04,114 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:54:04,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:04,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:54:04,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:54:04,115 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f80b27594aadcdaa93090b35b429df9d0a90b0252fa7b12ed0563c83d3b4cc77 [2025-02-08 01:54:04,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:54:04,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:54:04,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:54:04,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:54:04,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:54:04,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2025-02-08 01:54:05,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e975750c7/02435137e3c343f09b71d67073c4f2e3/FLAGb35b54d33 [2025-02-08 01:54:05,849 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:54:05,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_rend_harness_negated.i [2025-02-08 01:54:05,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e975750c7/02435137e3c343f09b71d67073c4f2e3/FLAGb35b54d33 [2025-02-08 01:54:05,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e975750c7/02435137e3c343f09b71d67073c4f2e3 [2025-02-08 01:54:05,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:54:05,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:54:05,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:05,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:54:05,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:54:05,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:05" (1/1) ... [2025-02-08 01:54:05,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b67ad3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:05, skipping insertion in model container [2025-02-08 01:54:05,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:54:05" (1/1) ... [2025-02-08 01:54:06,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:54:06,161 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/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2025-02-08 01:54:06,165 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/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2025-02-08 01:54:06,535 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,536 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,536 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,536 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,537 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,545 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,546 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,547 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,548 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,549 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,834 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/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2025-02-08 01:54:06,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:06,845 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:54:06,857 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/aws-c-common/aws_linked_list_rend_harness_negated.i[4494,4507] [2025-02-08 01:54:06,858 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/aws-c-common/aws_linked_list_rend_harness_negated.i[4554,4567] [2025-02-08 01:54:06,894 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,894 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,895 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,905 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,906 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,907 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,907 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,909 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:54:06,980 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/aws-c-common/aws_linked_list_rend_harness_negated.i[150678,150691] [2025-02-08 01:54:06,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:54:07,099 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:54:07,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07 WrapperNode [2025-02-08 01:54:07,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:54:07,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:07,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:54:07,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:54:07,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,178 INFO L138 Inliner]: procedures = 668, calls = 1038, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 131 [2025-02-08 01:54:07,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:54:07,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:54:07,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:54:07,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:54:07,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,188 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,203 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 14, 5]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2025-02-08 01:54:07,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:54:07,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:54:07,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:54:07,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:54:07,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (1/1) ... [2025-02-08 01:54:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:54:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:07,258 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-08 01:54:07,260 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-08 01:54:07,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:54:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:54:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:54:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:54:07,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:54:07,276 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:54:07,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:54:07,277 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:54:07,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:54:07,477 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:54:07,478 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:54:07,531 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-02-08 01:54:07,537 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:54:07,668 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:54:07,668 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:54:07,688 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-08 01:54:07,689 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:54:07,695 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:54:07,696 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:54:07,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07 BoogieIcfgContainer [2025-02-08 01:54:07,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:54:07,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:54:07,698 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:54:07,701 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:54:07,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:54:05" (1/3) ... [2025-02-08 01:54:07,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7b762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 01:54:07,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:54:07" (2/3) ... [2025-02-08 01:54:07,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7b762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:54:07, skipping insertion in model container [2025-02-08 01:54:07,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07" (3/3) ... [2025-02-08 01:54:07,704 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2025-02-08 01:54:07,714 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:54:07,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rend_harness_negated.i that has 6 procedures, 62 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:54:07,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:54:07,761 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;@5127155d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:54:07,762 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:54:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 43 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 01:54:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 01:54:07,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:07,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:07,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:07,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash 340973796, now seen corresponding path program 1 times [2025-02-08 01:54:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:07,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14008184] [2025-02-08 01:54:07,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:54:07,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:54:07,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:07,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:54:08,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14008184] [2025-02-08 01:54:08,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14008184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762352614] [2025-02-08 01:54:08,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:08,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:08,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:08,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:54:08,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:54:08,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:54:08,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:08,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:54:08,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:54:08,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:54:08,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762352614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:54:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:54:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849870149] [2025-02-08 01:54:08,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:08,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:54:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:08,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:54:08,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:54:08,300 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 43 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 01:54:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:08,313 INFO L93 Difference]: Finished difference Result 117 states and 163 transitions. [2025-02-08 01:54:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:54:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-02-08 01:54:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:08,318 INFO L225 Difference]: With dead ends: 117 [2025-02-08 01:54:08,318 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 01:54:08,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 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-08 01:54:08,322 INFO L435 NwaCegarLoop]: 80 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, 80 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-08 01:54:08,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 01:54:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 01:54:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:54:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-02-08 01:54:08,342 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 68 [2025-02-08 01:54:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:08,343 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-02-08 01:54:08,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-08 01:54:08,343 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-02-08 01:54:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 01:54:08,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:08,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:08,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 01:54:08,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:54:08,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:08,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2114816675, now seen corresponding path program 1 times [2025-02-08 01:54:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:08,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943155818] [2025-02-08 01:54:08,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:08,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 01:54:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 01:54:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-08 01:54:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:09,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943155818] [2025-02-08 01:54:09,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943155818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:09,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:54:09,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:54:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970285473] [2025-02-08 01:54:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:09,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:54:09,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:09,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:54:09,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:54:09,101 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 01:54:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:09,143 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2025-02-08 01:54:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:54:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-02-08 01:54:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:09,145 INFO L225 Difference]: With dead ends: 51 [2025-02-08 01:54:09,145 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 01:54:09,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:54:09,145 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:09,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 260 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:54:09,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 01:54:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-02-08 01:54:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 32 states have internal predecessors, (37), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 01:54:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2025-02-08 01:54:09,154 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 68 [2025-02-08 01:54:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:09,155 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2025-02-08 01:54:09,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-02-08 01:54:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2025-02-08 01:54:09,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:54:09,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:09,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:09,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:54:09,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1618153193, now seen corresponding path program 1 times [2025-02-08 01:54:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393572878] [2025-02-08 01:54:09,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:09,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:54:09,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:54:09,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:09,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:54:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:09,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393572878] [2025-02-08 01:54:09,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393572878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:09,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967938061] [2025-02-08 01:54:09,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:09,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:09,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:54:09,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:54:09,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:54:09,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:09,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:09,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 01:54:09,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:09,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:54:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-08 01:54:09,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2025-02-08 01:54:09,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:09,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2025-02-08 01:54:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 01:54:10,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:54:10,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967938061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:54:10,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:54:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-08 01:54:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615512891] [2025-02-08 01:54:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:54:10,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:54:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:54:10,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:54:10,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:54:10,814 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:54:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:11,299 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2025-02-08 01:54:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:54:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:54:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:11,300 INFO L225 Difference]: With dead ends: 133 [2025-02-08 01:54:11,300 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 01:54:11,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:54:11,301 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 26 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:11,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 272 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 01:54:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 01:54:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-02-08 01:54:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 58 states have internal predecessors, (67), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:54:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2025-02-08 01:54:11,312 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 74 [2025-02-08 01:54:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:11,313 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2025-02-08 01:54:11,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 10 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:54:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2025-02-08 01:54:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:54:11,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:11,314 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:54:11,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:54:11,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:11,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1010642696, now seen corresponding path program 1 times [2025-02-08 01:54:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872535730] [2025-02-08 01:54:11,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:11,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:54:11,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:54:11,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:11,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:11,739 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:54:11,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872535730] [2025-02-08 01:54:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872535730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608016719] [2025-02-08 01:54:11,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:11,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:11,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:54:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:54:11,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:54:11,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:11,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:11,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 01:54:11,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:11,925 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2025-02-08 01:54:11,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2025-02-08 01:54:11,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 01:54:11,949 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:11,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-02-08 01:54:11,975 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:11,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2025-02-08 01:54:11,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 01:54:16,032 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$#1.base| .cse1 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse0 .cse2 .cse1)) .cse1)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| .cse1))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|)))) is different from true [2025-02-08 01:54:16,353 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))))) is different from true [2025-02-08 01:54:24,722 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse4)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))))) is different from true [2025-02-08 01:54:57,948 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#1.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse4)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#1.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_7|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse9))) (= .cse10 (select (store (store |c_#memory_$Pointer$#1.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| (store .cse10 .cse11 .cse9)) .cse9)))))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#1.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$#1.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| (store .cse13 .cse14 .cse12)) .cse12) .cse13))) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| .cse12))))))))) is different from true [2025-02-08 01:54:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 40 not checked. [2025-02-08 01:54:59,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:54:59,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:54:59,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 232 [2025-02-08 01:54:59,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 146 [2025-02-08 01:54:59,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 117 [2025-02-08 01:55:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:55:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608016719] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:00,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 01:55:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 31 [2025-02-08 01:55:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365238218] [2025-02-08 01:55:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:00,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:55:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:55:00,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=593, Unknown=33, NotChecked=212, Total=930 [2025-02-08 01:55:00,803 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:05,154 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2025-02-08 01:55:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:55:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:55:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:05,156 INFO L225 Difference]: With dead ends: 139 [2025-02-08 01:55:05,157 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 01:55:05,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=113, Invalid=799, Unknown=34, NotChecked=244, Total=1190 [2025-02-08 01:55:05,158 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:05,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 235 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:55:05,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 01:55:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2025-02-08 01:55:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 58 states have internal predecessors, (66), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:55:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2025-02-08 01:55:05,170 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 74 [2025-02-08 01:55:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:05,170 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2025-02-08 01:55:05,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2025-02-08 01:55:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:55:05,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:05,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:05,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:55:05,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:05,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:05,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1308607335, now seen corresponding path program 1 times [2025-02-08 01:55:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357803565] [2025-02-08 01:55:05,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:05,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:05,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:05,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:05,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 01:55:05,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357803565] [2025-02-08 01:55:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357803565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603563346] [2025-02-08 01:55:05,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:05,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:05,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:55:05,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:55:05,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:05,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:05,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:05,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:05,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 01:55:05,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:05,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:55:05,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:55:05,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2025-02-08 01:55:05,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:05,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2025-02-08 01:55:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:55:07,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603563346] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:07,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:07,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2025-02-08 01:55:07,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404016247] [2025-02-08 01:55:07,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:07,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:55:07,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:07,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:55:07,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-08 01:55:07,007 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:07,653 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2025-02-08 01:55:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 01:55:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:55:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:07,655 INFO L225 Difference]: With dead ends: 137 [2025-02-08 01:55:07,655 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 01:55:07,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-02-08 01:55:07,656 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 30 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:07,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 325 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 01:55:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 01:55:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-02-08 01:55:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:55:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-02-08 01:55:07,666 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 74 [2025-02-08 01:55:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:07,666 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-02-08 01:55:07,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2025-02-08 01:55:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:55:07,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:07,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:07,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 01:55:07,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:07,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:07,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash 110183418, now seen corresponding path program 1 times [2025-02-08 01:55:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:07,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10510493] [2025-02-08 01:55:07,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:07,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:07,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:07,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:07,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:55:08,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10510493] [2025-02-08 01:55:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10510493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750912186] [2025-02-08 01:55:08,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:08,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:08,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:55:08,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 01:55:08,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:08,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:08,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:08,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:08,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 01:55:08,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:08,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-08 01:55:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 01:55:08,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750912186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 17 [2025-02-08 01:55:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475897067] [2025-02-08 01:55:08,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:08,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 01:55:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:08,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 01:55:08,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-08 01:55:08,825 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:09,084 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2025-02-08 01:55:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:55:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2025-02-08 01:55:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:09,085 INFO L225 Difference]: With dead ends: 139 [2025-02-08 01:55:09,085 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 01:55:09,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-02-08 01:55:09,086 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:09,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 329 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 01:55:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 01:55:09,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-02-08 01:55:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-08 01:55:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2025-02-08 01:55:09,095 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 74 [2025-02-08 01:55:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:09,096 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2025-02-08 01:55:09,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 01:55:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2025-02-08 01:55:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 01:55:09,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:09,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:09,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 01:55:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:09,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:09,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2063464219, now seen corresponding path program 1 times [2025-02-08 01:55:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:09,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846688361] [2025-02-08 01:55:09,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:09,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:09,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-08 01:55:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846688361] [2025-02-08 01:55:09,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846688361] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:09,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532503992] [2025-02-08 01:55:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:09,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:09,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:55:09,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 01:55:09,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 01:55:09,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 01:55:09,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:09,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:09,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 01:55:09,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 01:55:09,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:55:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532503992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:55:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:55:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-08 01:55:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311115904] [2025-02-08 01:55:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:55:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:55:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:09,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:55:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:09,535 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:55:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:09,562 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2025-02-08 01:55:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 01:55:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-08 01:55:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:09,563 INFO L225 Difference]: With dead ends: 149 [2025-02-08 01:55:09,563 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 01:55:09,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:55:09,564 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:09,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 191 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:55:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 01:55:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 01:55:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2025-02-08 01:55:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-02-08 01:55:09,573 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 74 [2025-02-08 01:55:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-02-08 01:55:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-08 01:55:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-02-08 01:55:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 01:55:09,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:55:09,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:09,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 01:55:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-08 01:55:09,780 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:55:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:55:09,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1287853871, now seen corresponding path program 1 times [2025-02-08 01:55:09,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:55:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5538181] [2025-02-08 01:55:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:55:09,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:55:09,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:55:09,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:09,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-08 01:55:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:55:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5538181] [2025-02-08 01:55:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5538181] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:55:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254721763] [2025-02-08 01:55:09,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:55:09,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:09,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:55:09,987 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:55:09,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 01:55:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 01:55:10,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 01:55:10,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:55:10,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:55:10,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-08 01:55:10,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:55:10,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:55:10,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-08 01:55:10,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2025-02-08 01:55:10,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-08 01:55:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 01:55:10,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2025-02-08 01:55:10,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2025-02-08 01:55:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2025-02-08 01:55:10,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:55:10,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 40 [2025-02-08 01:55:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 01:55:10,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:55:10,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:10,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 92 [2025-02-08 01:55:10,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-02-08 01:55:10,940 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 1)) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_subst_1 Int)) (or (forall ((v_ArrVal_543 Int) (v_ArrVal_549 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_543)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_arrayElimArr_5))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_549))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (not (= (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16) (select v_arrayElimArr_5 v_subst_1))))))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| Int)) (or (forall ((v_ArrVal_544 Int) (v_ArrVal_551 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_544)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| v_ArrVal_551))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_14| 1)))))) is different from false [2025-02-08 01:55:10,955 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:55:10,956 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:55:11,009 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:55:11,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 305 treesize of output 292 [2025-02-08 01:55:11,018 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:55:11,019 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:55:11,074 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-08 01:55:11,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 209 treesize of output 238 [2025-02-08 01:55:11,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 266 [2025-02-08 01:55:11,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:11,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 222 [2025-02-08 01:55:11,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:11,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 302 [2025-02-08 01:55:11,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 257 [2025-02-08 01:55:11,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 01:55:11,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-02-08 01:55:11,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:11,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 103 [2025-02-08 01:55:11,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 01:55:11,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 63 [2025-02-08 01:55:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2025-02-08 01:55:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254721763] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:55:11,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:55:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 21 [2025-02-08 01:55:11,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095111972] [2025-02-08 01:55:11,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:55:11,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 01:55:11,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:55:11,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 01:55:11,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=311, Unknown=16, NotChecked=36, Total=420 [2025-02-08 01:55:11,506 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 21 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-02-08 01:55:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:55:11,923 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2025-02-08 01:55:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 01:55:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 75 [2025-02-08 01:55:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:55:11,924 INFO L225 Difference]: With dead ends: 99 [2025-02-08 01:55:11,924 INFO L226 Difference]: Without dead ends: 0 [2025-02-08 01:55:11,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=629, Unknown=21, NotChecked=52, Total=812 [2025-02-08 01:55:11,925 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 01:55:11,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 219 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2025-02-08 01:55:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-08 01:55:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-08 01:55:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 01:55:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-08 01:55:11,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2025-02-08 01:55:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:55:11,926 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-08 01:55:11,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 4.611111111111111) internal successors, (83), 19 states have internal predecessors, (83), 7 states have call successors, (21), 3 states have call predecessors, (21), 6 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-02-08 01:55:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-08 01:55:11,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-08 01:55:11,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 01:55:11,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 01:55:12,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:55:12,139 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:55:12,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-08 01:55:13,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:55:13,163 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!offset [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!base [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:55:13,165 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-08 01:55:13,166 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-08 01:55:13,167 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-08 01:55:13,168 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-08 01:55:13,168 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-08 01:55:13,169 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 01:55:13,169 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 01:55:13,169 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-08 01:55:13,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:55:13 BoogieIcfgContainer [2025-02-08 01:55:13,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:55:13,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:55:13,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:55:13,170 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:55:13,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:54:07" (3/4) ... [2025-02-08 01:55:13,172 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:55:13,177 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-08 01:55:13,177 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-02-08 01:55:13,178 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-08 01:55:13,178 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-08 01:55:13,178 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2025-02-08 01:55:13,180 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-02-08 01:55:13,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-08 01:55:13,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:55:13,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:55:13,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:55:13,247 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:55:13,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:55:13,248 INFO L158 Benchmark]: Toolchain (without parser) took 67284.74ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 98.0MB in the beginning and 308.6MB in the end (delta: -210.6MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,248 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:55:13,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1136.01ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 40.6MB in the end (delta: 57.4MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,248 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.41ms. Allocated memory is still 142.6MB. Free memory was 40.6MB in the beginning and 95.5MB in the end (delta: -54.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,249 INFO L158 Benchmark]: Boogie Preprocessor took 44.66ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:55:13,249 INFO L158 Benchmark]: IcfgBuilder took 471.94ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 67.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,250 INFO L158 Benchmark]: TraceAbstraction took 65471.33ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 66.9MB in the beginning and 312.9MB in the end (delta: -246.0MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,250 INFO L158 Benchmark]: Witness Printer took 77.70ms. Allocated memory is still 385.9MB. Free memory was 312.9MB in the beginning and 308.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:55:13,252 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.25ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1136.01ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 40.6MB in the end (delta: 57.4MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.41ms. Allocated memory is still 142.6MB. Free memory was 40.6MB in the beginning and 95.5MB in the end (delta: -54.9MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.66ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 471.94ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 67.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65471.33ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 66.9MB in the beginning and 312.9MB in the end (delta: -246.0MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. * Witness Printer took 77.70ms. Allocated memory is still 385.9MB. Free memory was 312.9MB in the beginning and 308.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.4s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 1911 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 35 IncrementalHoareTripleChecker+Unchecked, 1530 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 381 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 725 GetRequests, 581 SyntacticMatches, 21 SemanticMatches, 123 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 53.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 1094 NumberOfCodeBlocks, 1094 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1226 ConstructedInterpolants, 193 QuantifiedInterpolants, 23424 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2258 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 712/847 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:55:13,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE