./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_front_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_front_harness.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 21fc7c48ba3810a0e594494bae8b55e00a43dfc3f9be173ed5371437deb91c4d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:17:21,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:17:21,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 05:17:21,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:17:21,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:17:21,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:17:21,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:17:21,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:17:21,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:17:21,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:17:21,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:17:21,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:17:21,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:17:21,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:17:21,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:17:21,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:17:21,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:17:21,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:21,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:17:21,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:17:21,212 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 -> 21fc7c48ba3810a0e594494bae8b55e00a43dfc3f9be173ed5371437deb91c4d [2025-02-06 05:17:21,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:17:21,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:17:21,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:17:21,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:17:21,482 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:17:21,483 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_push_front_harness.i [2025-02-06 05:17:22,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd58b7a9/92d939f4610c451b8b11f8ab4fa5a848/FLAGb6bace5bc [2025-02-06 05:17:23,073 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:17:23,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_front_harness.i [2025-02-06 05:17:23,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd58b7a9/92d939f4610c451b8b11f8ab4fa5a848/FLAGb6bace5bc [2025-02-06 05:17:23,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6bd58b7a9/92d939f4610c451b8b11f8ab4fa5a848 [2025-02-06 05:17:23,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:17:23,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:17:23,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:23,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:17:23,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:17:23,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:23" (1/1) ... [2025-02-06 05:17:23,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a1d0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:23, skipping insertion in model container [2025-02-06 05:17:23,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:17:23" (1/1) ... [2025-02-06 05:17:23,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:17:23,353 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_push_front_harness.i[4500,4513] [2025-02-06 05:17:23,359 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_push_front_harness.i[4560,4573] [2025-02-06 05:17:23,796 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,797 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,798 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,807 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,807 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,808 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,809 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,810 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,810 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,811 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:23,811 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,119 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_push_front_harness.i[150811,150824] [2025-02-06 05:17:24,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:24,132 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:17:24,141 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_push_front_harness.i[4500,4513] [2025-02-06 05:17:24,141 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_push_front_harness.i[4560,4573] [2025-02-06 05:17:24,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,186 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,187 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,187 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,192 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,193 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,194 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,195 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:17:24,247 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_push_front_harness.i[150811,150824] [2025-02-06 05:17:24,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:17:24,402 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:17:24,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24 WrapperNode [2025-02-06 05:17:24,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:17:24,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:24,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:17:24,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:17:24,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,474 INFO L138 Inliner]: procedures = 668, calls = 1046, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 147 [2025-02-06 05:17:24,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:17:24,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:17:24,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:17:24,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:17:24,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,504 INFO L175 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 5, 29]. 81 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 10 writes are split as follows [0, 0, 10]. [2025-02-06 05:17:24,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,522 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:17:24,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:17:24,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:17:24,533 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:17:24,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (1/1) ... [2025-02-06 05:17:24,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:17:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:24,567 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-06 05:17:24,572 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-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:17:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:17:24,587 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:17:24,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2025-02-06 05:17:24,588 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:17:24,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:17:24,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:17:24,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:17:24,589 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:17:24,589 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:17:24,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:17:24,794 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:17:24,796 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:17:24,837 INFO L1309 $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-06 05:17:24,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4729: havoc #t~mem317.base, #t~mem317.offset;havoc #t~short318;havoc #t~mem319.base, #t~mem319.offset;havoc #t~mem320.base, #t~mem320.offset;havoc #t~short321; [2025-02-06 05:17:24,861 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:17:25,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:17:25,072 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-02-06 05:17:25,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:17:25,085 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:17:25,086 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:17:25,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:25 BoogieIcfgContainer [2025-02-06 05:17:25,087 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:17:25,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:17:25,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:17:25,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:17:25,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:17:23" (1/3) ... [2025-02-06 05:17:25,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547a0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:25, skipping insertion in model container [2025-02-06 05:17:25,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:17:24" (2/3) ... [2025-02-06 05:17:25,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7547a0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:17:25, skipping insertion in model container [2025-02-06 05:17:25,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:25" (3/3) ... [2025-02-06 05:17:25,096 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_front_harness.i [2025-02-06 05:17:25,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:17:25,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_push_front_harness.i that has 8 procedures, 103 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-06 05:17:25,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:17:25,162 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;@143ab66a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:17:25,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:17:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 67 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 05:17:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 05:17:25,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:25,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:25,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1525047615, now seen corresponding path program 1 times [2025-02-06 05:17:25,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:25,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257813310] [2025-02-06 05:17:25,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:25,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:17:25,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:17:25,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:25,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 05:17:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257813310] [2025-02-06 05:17:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257813310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:25,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813877671] [2025-02-06 05:17:25,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:25,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:25,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:25,488 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-06 05:17:25,490 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-06 05:17:25,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:17:25,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:17:25,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:25,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:25,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:17:25,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-02-06 05:17:25,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:25,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813877671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:25,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:25,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:17:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203706331] [2025-02-06 05:17:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:25,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:17:25,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:25,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:17:25,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:17:25,753 INFO L87 Difference]: Start difference. First operand has 103 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 67 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:17:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:25,784 INFO L93 Difference]: Finished difference Result 198 states and 286 transitions. [2025-02-06 05:17:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:17:25,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2025-02-06 05:17:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:25,790 INFO L225 Difference]: With dead ends: 198 [2025-02-06 05:17:25,791 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 05:17:25,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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-06 05:17:25,795 INFO L435 NwaCegarLoop]: 137 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, 137 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-06 05:17:25,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 05:17:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 05:17:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 63 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 05:17:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2025-02-06 05:17:25,832 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 74 [2025-02-06 05:17:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:25,832 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2025-02-06 05:17:25,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 05:17:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2025-02-06 05:17:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-06 05:17:25,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:25,834 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:25,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:17:26,036 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-06 05:17:26,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 888960956, now seen corresponding path program 1 times [2025-02-06 05:17:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129176968] [2025-02-06 05:17:26,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:17:26,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:17:26,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:26,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 05:17:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:26,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129176968] [2025-02-06 05:17:26,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129176968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:26,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780414634] [2025-02-06 05:17:26,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:26,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:26,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:26,802 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-06 05:17:26,804 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-06 05:17:26,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-06 05:17:26,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-06 05:17:26,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:26,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:26,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 05:17:26,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:27,087 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 14 treesize of output 15 [2025-02-06 05:17:27,105 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 14 treesize of output 15 [2025-02-06 05:17:27,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:27,165 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 1 case distinctions, treesize of input 29 treesize of output 35 [2025-02-06 05:17:27,178 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 29 treesize of output 35 [2025-02-06 05:17:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 05:17:27,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780414634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:27,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:27,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-06 05:17:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042215715] [2025-02-06 05:17:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:17:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:27,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:17:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 05:17:27,895 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:17:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:28,473 INFO L93 Difference]: Finished difference Result 241 states and 325 transitions. [2025-02-06 05:17:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 05:17:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2025-02-06 05:17:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:28,476 INFO L225 Difference]: With dead ends: 241 [2025-02-06 05:17:28,477 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 05:17:28,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-06 05:17:28,483 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 72 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:28,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 607 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:17:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 05:17:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2025-02-06 05:17:28,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 103 states have internal predecessors, (130), 36 states have call successors, (36), 12 states have call predecessors, (36), 11 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 05:17:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 201 transitions. [2025-02-06 05:17:28,497 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 201 transitions. Word has length 74 [2025-02-06 05:17:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:28,497 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 201 transitions. [2025-02-06 05:17:28,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:17:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 201 transitions. [2025-02-06 05:17:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 05:17:28,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:28,503 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:28,511 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-06 05:17:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:28,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:28,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 880770296, now seen corresponding path program 1 times [2025-02-06 05:17:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84636429] [2025-02-06 05:17:28,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:28,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 05:17:28,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 05:17:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 05:17:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84636429] [2025-02-06 05:17:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84636429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117700992] [2025-02-06 05:17:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:29,079 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-06 05:17:29,081 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-06 05:17:29,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 05:17:29,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 05:17:29,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:29,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:29,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 05:17:29,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:29,306 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-06 05:17:29,318 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-06 05:17:29,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,371 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-06 05:17:29,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,378 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-06 05:17:29,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,390 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-06 05:17:29,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,398 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 34 treesize of output 25 [2025-02-06 05:17:29,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2025-02-06 05:17:29,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:29,480 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 90 treesize of output 44 [2025-02-06 05:17:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 05:17:30,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:30,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,656 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 99 treesize of output 100 [2025-02-06 05:17:30,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,667 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-06 05:17:30,699 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-06 05:17:30,715 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 6 treesize of output 4 [2025-02-06 05:17:30,741 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_push_front_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int)) (or (forall ((v_arrayElimArr_4 (Array Int Int)) (v_subst_1 Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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| 0)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_arrayElimArr_4))) (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_subst_1))) |c_ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) .cse2) 0) (not (= (select v_arrayElimArr_4 v_subst_1) (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 16))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| 1)) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_2 Int)) (or (forall ((v_ArrVal_441 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.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_441)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_11| v_arrayElimArr_3))) (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_11|))) |c_ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base|) .cse2) 0)) (not (= |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (select v_arrayElimArr_3 v_subst_2))))))))) is different from false [2025-02-06 05:17:30,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:30,762 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:30,818 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:17:30,818 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 185 treesize of output 214 [2025-02-06 05:17:30,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:30,833 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:30,901 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:17:30,902 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 215 treesize of output 244 [2025-02-06 05:17:30,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,918 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 282 treesize of output 278 [2025-02-06 05:17:30,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,937 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 231 treesize of output 228 [2025-02-06 05:17:30,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,968 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 318 treesize of output 316 [2025-02-06 05:17:30,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:30,998 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 275 treesize of output 272 [2025-02-06 05:17:31,606 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-06 05:17:31,899 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 7 treesize of output 3 [2025-02-06 05:17:32,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:32,044 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 159 treesize of output 161 [2025-02-06 05:17:32,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:32,094 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:32,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 66 [2025-02-06 05:17:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 1 not checked. [2025-02-06 05:17:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117700992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:32,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:32,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2025-02-06 05:17:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766534127] [2025-02-06 05:17:32,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 05:17:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:32,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 05:17:32,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=401, Unknown=1, NotChecked=40, Total=506 [2025-02-06 05:17:32,184 INFO L87 Difference]: Start difference. First operand 149 states and 201 transitions. Second operand has 23 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 05:17:36,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 05:17:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:37,022 INFO L93 Difference]: Finished difference Result 309 states and 413 transitions. [2025-02-06 05:17:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 05:17:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) Word has length 75 [2025-02-06 05:17:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:37,024 INFO L225 Difference]: With dead ends: 309 [2025-02-06 05:17:37,024 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 05:17:37,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=1099, Unknown=1, NotChecked=68, Total=1332 [2025-02-06 05:17:37,026 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 78 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:37,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 2352 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 917 Invalid, 0 Unknown, 135 Unchecked, 4.2s Time] [2025-02-06 05:17:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 05:17:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 134. [2025-02-06 05:17:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 05:17:37,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 177 transitions. [2025-02-06 05:17:37,043 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 177 transitions. Word has length 75 [2025-02-06 05:17:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 177 transitions. [2025-02-06 05:17:37,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.15) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (24), 3 states have call predecessors, (24), 6 states have return successors, (22), 5 states have call predecessors, (22), 7 states have call successors, (22) [2025-02-06 05:17:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 177 transitions. [2025-02-06 05:17:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 05:17:37,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:37,046 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:37,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 05:17:37,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:37,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:37,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:37,247 INFO L85 PathProgramCache]: Analyzing trace with hash 516251436, now seen corresponding path program 1 times [2025-02-06 05:17:37,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:37,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793272636] [2025-02-06 05:17:37,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:37,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:37,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 05:17:37,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 05:17:37,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-06 05:17:37,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793272636] [2025-02-06 05:17:37,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793272636] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:37,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404785052] [2025-02-06 05:17:37,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:37,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:37,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:37,661 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-06 05:17:37,663 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-06 05:17:37,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-06 05:17:37,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 05:17:37,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:37,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:37,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 05:17:37,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 05:17:37,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404785052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 12 [2025-02-06 05:17:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561598232] [2025-02-06 05:17:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:17:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:37,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:17:37,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 05:17:37,901 INFO L87 Difference]: Start difference. First operand 134 states and 177 transitions. Second operand has 10 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:17:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:38,141 INFO L93 Difference]: Finished difference Result 235 states and 311 transitions. [2025-02-06 05:17:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 05:17:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2025-02-06 05:17:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:38,143 INFO L225 Difference]: With dead ends: 235 [2025-02-06 05:17:38,143 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 05:17:38,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-02-06 05:17:38,144 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 129 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:38,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 826 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:17:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 05:17:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2025-02-06 05:17:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 94 states have internal predecessors, (118), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 05:17:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 175 transitions. [2025-02-06 05:17:38,159 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 175 transitions. Word has length 75 [2025-02-06 05:17:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:38,159 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 175 transitions. [2025-02-06 05:17:38,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 05:17:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 175 transitions. [2025-02-06 05:17:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 05:17:38,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:38,160 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:38,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:38,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:38,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:38,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1538444660, now seen corresponding path program 1 times [2025-02-06 05:17:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:38,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735331950] [2025-02-06 05:17:38,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-06 05:17:38,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-06 05:17:38,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-06 05:17:38,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:38,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735331950] [2025-02-06 05:17:38,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735331950] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:38,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:17:38,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 05:17:38,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177582777] [2025-02-06 05:17:38,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:38,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 05:17:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:38,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 05:17:38,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:17:38,499 INFO L87 Difference]: Start difference. First operand 134 states and 175 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:17:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:38,549 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2025-02-06 05:17:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 05:17:38,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2025-02-06 05:17:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:38,551 INFO L225 Difference]: With dead ends: 136 [2025-02-06 05:17:38,551 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 05:17:38,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 05:17:38,552 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:38,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 207 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 05:17:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 05:17:38,553 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-06 05:17:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 05:17:38,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-02-06 05:17:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:38,553 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 05:17:38,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 05:17:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 05:17:38,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 05:17:38,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 05:17:38,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 05:17:38,561 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 05:17:38,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 05:17:39,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 05:17:39,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#to_add~0!base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!offset [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-06 05:17:39,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!offset [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~curr~0!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!offset [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-06 05:17:39,993 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#list~0!base [2025-02-06 05:17:39,994 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~list!base [2025-02-06 05:17:39,994 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~list!base [2025-02-06 05:17:39,994 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 05:17:39,994 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-06 05:17:39,994 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2025-02-06 05:17:39,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 05:17:39 BoogieIcfgContainer [2025-02-06 05:17:39,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 05:17:39,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 05:17:39,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 05:17:39,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 05:17:39,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:17:25" (3/4) ... [2025-02-06 05:17:39,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_insert_before [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-02-06 05:17:40,002 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2025-02-06 05:17:40,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-02-06 05:17:40,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-06 05:17:40,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-06 05:17:40,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 05:17:40,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 05:17:40,068 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 05:17:40,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 05:17:40,069 INFO L158 Benchmark]: Toolchain (without parser) took 16943.15ms. Allocated memory was 142.6MB in the beginning and 671.1MB in the end (delta: 528.5MB). Free memory was 107.4MB in the beginning and 282.5MB in the end (delta: -175.1MB). Peak memory consumption was 345.6MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,069 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:17:40,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1275.07ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 107.4MB in the beginning and 348.0MB in the end (delta: -240.6MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.53ms. Allocated memory is still 394.3MB. Free memory was 348.0MB in the beginning and 342.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 05:17:40,070 INFO L158 Benchmark]: Boogie Preprocessor took 55.83ms. Allocated memory is still 394.3MB. Free memory was 342.3MB in the beginning and 337.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,070 INFO L158 Benchmark]: IcfgBuilder took 554.47ms. Allocated memory is still 394.3MB. Free memory was 337.9MB in the beginning and 305.9MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,070 INFO L158 Benchmark]: TraceAbstraction took 14906.13ms. Allocated memory was 394.3MB in the beginning and 671.1MB in the end (delta: 276.8MB). Free memory was 305.1MB in the beginning and 290.9MB in the end (delta: 14.3MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,070 INFO L158 Benchmark]: Witness Printer took 73.36ms. Allocated memory is still 671.1MB. Free memory was 290.9MB in the beginning and 282.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 05:17:40,071 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.20ms. Allocated memory is still 201.3MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1275.07ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 107.4MB in the beginning and 348.0MB in the end (delta: -240.6MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.53ms. Allocated memory is still 394.3MB. Free memory was 348.0MB in the beginning and 342.3MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.83ms. Allocated memory is still 394.3MB. Free memory was 342.3MB in the beginning and 337.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 554.47ms. Allocated memory is still 394.3MB. Free memory was 337.9MB in the beginning and 305.9MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14906.13ms. Allocated memory was 394.3MB in the beginning and 671.1MB in the end (delta: 276.8MB). Free memory was 305.1MB in the beginning and 290.9MB in the end (delta: 14.3MB). Peak memory consumption was 285.9MB. Max. memory is 16.1GB. * Witness Printer took 73.36ms. Allocated memory is still 671.1MB. Free memory was 290.9MB in the beginning and 282.5MB in the end (delta: 8.4MB). 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: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#to_add~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!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: ~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~curr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - 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: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~list!base,]]] - 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$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~list!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#list~0!offset - 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: #in~list!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~list!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: Unknown variable: #StackHeapBarrier * 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 8 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 4129 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 3568 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1386 IncrementalHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 561 mSDtfsCounter, 1386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=2, InterpolantAutomatonStates: 57, 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, 5 MinimizatonAttempts, 66 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 738 ConstructedInterpolants, 29 QuantifiedInterpolants, 4267 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1780 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 436/473 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-06 05:17:40,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE