./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_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-?-48c9605-m [2025-02-08 01:53:22,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:53:22,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 01:53:22,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:53:22,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:53:22,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:53:22,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:53:22,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:53:22,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:53:22,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:53:22,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:53:22,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:53:22,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:53:22,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:53:22,622 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:53:22,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:53:22,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:53:22,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:53:22,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:53:22,623 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:53:22,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:53:22,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:53:22,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:53:22,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:22,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:53:22,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:53:22,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:53:22,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:53:22,626 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-08 01:53:22,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:53:22,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:53:22,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:53:22,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:53:22,910 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:53:22,912 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-08 01:53:23,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b76bc4b2/da24fc2d25ec45e5ae5e15a8ff76c0cb/FLAGab7700e82 [2025-02-08 01:53:25,364 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:53:25,364 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-08 01:53:25,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b76bc4b2/da24fc2d25ec45e5ae5e15a8ff76c0cb/FLAGab7700e82 [2025-02-08 01:53:25,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b76bc4b2/da24fc2d25ec45e5ae5e15a8ff76c0cb [2025-02-08 01:53:25,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:53:25,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:53:25,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:25,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:53:25,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:53:25,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:25" (1/1) ... [2025-02-08 01:53:25,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e0248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:25, skipping insertion in model container [2025-02-08 01:53:25,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:53:25" (1/1) ... [2025-02-08 01:53:25,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:53:25,738 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-08 01:53:25,746 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-08 01:53:26,455 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,456 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,457 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,458 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,459 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,469 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,470 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,472 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,472 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,474 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,475 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,476 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,476 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,833 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-08 01:53:26,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:26,851 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:53:26,865 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-08 01:53:26,869 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-08 01:53:26,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,910 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,915 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,916 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,928 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,928 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,929 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,929 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,930 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,931 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,931 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:26,931 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-08 01:53:27,026 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-08 01:53:27,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:53:27,164 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:53:27,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27 WrapperNode [2025-02-08 01:53:27,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:53:27,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:27,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:53:27,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:53:27,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,304 INFO L138 Inliner]: procedures = 668, calls = 1046, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 147 [2025-02-08 01:53:27,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:53:27,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:53:27,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:53:27,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:53:27,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,352 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-08 01:53:27,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,373 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,386 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:53:27,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:53:27,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:53:27,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:53:27,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (1/1) ... [2025-02-08 01:53:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:53:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:27,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 01:53:27,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 01:53:27,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 01:53:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 01:53:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 01:53:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-08 01:53:27,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-08 01:53:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2025-02-08 01:53:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2025-02-08 01:53:27,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:53:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 01:53:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 01:53:27,465 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-08 01:53:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-08 01:53:27,466 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-08 01:53:27,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:53:27,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:53:27,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:53:27,701 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:53:27,703 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:53:27,768 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4718: havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; [2025-02-08 01:53:27,796 INFO L1324 $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-08 01:53:27,804 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-08 01:53:28,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700-1: #t~ret311#1 := aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret322#1, aws_linked_list_is_valid_deep_#t~mem323#1.base, aws_linked_list_is_valid_deep_#t~mem323#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;havoc aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := (if 0 == #t~ret311#1 % 256 then 0 else 1);havoc #t~ret311#1; [2025-02-08 01:53:28,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-08 01:53:28,080 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-02-08 01:53:28,081 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:53:28,092 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:53:28,092 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:53:28,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:28 BoogieIcfgContainer [2025-02-08 01:53:28,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:53:28,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:53:28,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:53:28,099 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:53:28,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:53:25" (1/3) ... [2025-02-08 01:53:28,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56553a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:28, skipping insertion in model container [2025-02-08 01:53:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:53:27" (2/3) ... [2025-02-08 01:53:28,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56553a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:53:28, skipping insertion in model container [2025-02-08 01:53:28,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:53:28" (3/3) ... [2025-02-08 01:53:28,101 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_front_harness.i [2025-02-08 01:53:28,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:53:28,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_push_front_harness.i that has 8 procedures, 98 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 01:53:28,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:53:28,178 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;@76e02469, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:53:28,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 01:53:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 62 states have internal predecessors, (77), 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-08 01:53:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 01:53:28,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:28,191 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] [2025-02-08 01:53:28,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:28,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -62668221, now seen corresponding path program 1 times [2025-02-08 01:53:28,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:28,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959059170] [2025-02-08 01:53:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:28,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:28,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:28,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:28,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:28,585 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-08 01:53:28,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:28,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959059170] [2025-02-08 01:53:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959059170] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:28,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221825840] [2025-02-08 01:53:28,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:28,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:28,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:28,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:28,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 01:53:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:28,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:28,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:28,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:28,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-08 01:53:28,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:28,883 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-08 01:53:28,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:53:28,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221825840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:28,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:53:28,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-08 01:53:28,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359181390] [2025-02-08 01:53:28,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:28,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:53:28,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:28,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:53:28,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:53:28,905 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 62 states have internal predecessors, (77), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-08 01:53:28,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:28,932 INFO L93 Difference]: Finished difference Result 189 states and 275 transitions. [2025-02-08 01:53:28,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:53:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 72 [2025-02-08 01:53:28,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:28,939 INFO L225 Difference]: With dead ends: 189 [2025-02-08 01:53:28,940 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 01:53:28,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:53:28,945 INFO L435 NwaCegarLoop]: 131 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, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:28,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 01:53:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 01:53:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 01:53:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 54 states have internal predecessors, (63), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-08 01:53:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2025-02-08 01:53:28,985 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 72 [2025-02-08 01:53:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:28,985 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2025-02-08 01:53:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-08 01:53:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2025-02-08 01:53:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 01:53:28,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:28,988 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] [2025-02-08 01:53:28,995 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-08 01:53:29,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-08 01:53:29,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:29,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:29,190 INFO L85 PathProgramCache]: Analyzing trace with hash 117138590, now seen corresponding path program 1 times [2025-02-08 01:53:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:29,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785339196] [2025-02-08 01:53:29,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:29,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:29,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:29,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:29,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:30,257 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-08 01:53:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785339196] [2025-02-08 01:53:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785339196] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913097922] [2025-02-08 01:53:30,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:30,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:30,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:30,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 01:53:30,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:30,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:30,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 01:53:30,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:30,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:53:30,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:53:30,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,701 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 47 treesize of output 38 [2025-02-08 01:53:30,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:53:30,735 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 49 treesize of output 40 [2025-02-08 01:53:31,599 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-08 01:53:31,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:53:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913097922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:31,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:53:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2025-02-08 01:53:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405049747] [2025-02-08 01:53:31,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:53:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:31,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:53:31,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-08 01:53:31,602 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-08 01:53:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:53:32,222 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2025-02-08 01:53:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 01:53:32,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 72 [2025-02-08 01:53:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:53:32,225 INFO L225 Difference]: With dead ends: 206 [2025-02-08 01:53:32,225 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 01:53:32,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-08 01:53:32,227 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 45 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 01:53:32,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 461 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 01:53:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 01:53:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-02-08 01:53:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 34 states have call successors, (34), 11 states have call predecessors, (34), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-08 01:53:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2025-02-08 01:53:32,246 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 72 [2025-02-08 01:53:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:53:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2025-02-08 01:53:32,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-08 01:53:32,247 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2025-02-08 01:53:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 01:53:32,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:53:32,249 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] [2025-02-08 01:53:32,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 01:53:32,449 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-08 01:53:32,450 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:53:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:53:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1250329183, now seen corresponding path program 1 times [2025-02-08 01:53:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:53:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693699525] [2025-02-08 01:53:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:53:32,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:32,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:32,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:32,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:32,855 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-08 01:53:32,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:53:32,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693699525] [2025-02-08 01:53:32,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693699525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:53:32,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492237251] [2025-02-08 01:53:32,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:53:32,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:53:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:53:32,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:53:32,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 01:53:33,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:53:33,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:53:33,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:53:33,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:53:33,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 01:53:33,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:53:33,185 INFO L349 Elim1Store]: treesize reduction 42, result has 31.1 percent of original size [2025-02-08 01:53:33,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 80 [2025-02-08 01:53:33,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 01:53:33,212 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:53:33,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2025-02-08 01:53:33,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2025-02-08 01:53:45,787 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-08 01:53:45,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 01:53:45,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492237251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:53:45,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 01:53:45,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-02-08 01:53:45,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131006801] [2025-02-08 01:53:45,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:53:45,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 01:53:45,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:53:45,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 01:53:45,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=148, Unknown=2, NotChecked=0, Total=182 [2025-02-08 01:53:45,789 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-08 01:53:49,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:53,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:53:57,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:54:01,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:54:06,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:54:10,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-08 01:54:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 01:54:10,934 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2025-02-08 01:54:10,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:54:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 72 [2025-02-08 01:54:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 01:54:10,936 INFO L225 Difference]: With dead ends: 215 [2025-02-08 01:54:10,936 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 01:54:10,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2025-02-08 01:54:10,938 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 49 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2025-02-08 01:54:10,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 539 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 24.9s Time] [2025-02-08 01:54:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 01:54:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-02-08 01:54:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 80 states have internal predecessors, (93), 34 states have call successors, (34), 11 states have call predecessors, (34), 10 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-08 01:54:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2025-02-08 01:54:10,955 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 72 [2025-02-08 01:54:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 01:54:10,955 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2025-02-08 01:54:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-08 01:54:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2025-02-08 01:54:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 01:54:10,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 01:54:10,957 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] [2025-02-08 01:54:10,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:54:11,158 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-08 01:54:11,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:54:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:54:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -675204128, now seen corresponding path program 1 times [2025-02-08 01:54:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:54:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413903038] [2025-02-08 01:54:11,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:54:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:54:11,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:54:11,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:11,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:11,585 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-08 01:54:11,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:54:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413903038] [2025-02-08 01:54:11,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413903038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:54:11,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830021506] [2025-02-08 01:54:11,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:54:11,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:54:11,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:54:11,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 01:54:11,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 01:54:11,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 01:54:11,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 01:54:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:54:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:54:11,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 118 conjuncts are in the unsatisfiable core [2025-02-08 01:54:11,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:54:11,806 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 10 treesize of output 8 [2025-02-08 01:54:11,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2025-02-08 01:54:11,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-08 01:54:12,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2025-02-08 01:54:16,742 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_1 Int) (|ULTIMATE.start_aws_linked_list_push_front_~list#1.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|))) (and (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_1 (- 16)))) (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_1 8)))))) is different from true [2025-02-08 01:54:20,892 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_2 Int) (|ULTIMATE.start_aws_linked_list_push_front_~list#1.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|))) (and (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_2 (- 16)))) (= (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_2 8)) |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|)))) is different from true [2025-02-08 01:54:24,979 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_3 Int) (|ULTIMATE.start_aws_linked_list_push_front_~list#1.base| Int)) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_push_front_~list#1.base|))) (and (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_3 8))) (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| (select .cse0 (+ v_aws_linked_list_insert_before_~before.offset_BEFORE_CALL_3 (- 16))))))) is different from true [2025-02-08 01:54:25,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 162 [2025-02-08 01:54:25,113 INFO L349 Elim1Store]: treesize reduction 210, result has 0.5 percent of original size [2025-02-08 01:54:25,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 2570 treesize of output 1856 [2025-02-08 01:54:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,200 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 177 [2025-02-08 01:54:25,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 27 treesize of output 95 [2025-02-08 01:54:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,319 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,345 INFO L349 Elim1Store]: treesize reduction 77, result has 18.1 percent of original size [2025-02-08 01:54:25,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 238 treesize of output 415 [2025-02-08 01:54:25,373 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2025-02-08 01:54:25,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 01:54:25,415 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,429 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,437 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,446 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,456 INFO L349 Elim1Store]: treesize reduction 87, result has 1.1 percent of original size [2025-02-08 01:54:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 233 [2025-02-08 01:54:25,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-08 01:54:25,824 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 9 treesize of output 5 [2025-02-08 01:54:25,827 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 5 treesize of output 3 [2025-02-08 01:54:25,832 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 01:54:25,835 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 01:54:58,993 INFO L190 IndexEqualityManager]: detected not equals via solver