./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_pop_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_pop_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 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:16:50,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:16:50,829 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:16:50,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:16:50,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:16:50,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:16:50,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:16:50,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:16:50,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:16:50,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:16:50,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:16:50,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:16:50,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:16:50,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:16:50,850 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:16:50,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:16:50,851 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:50,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:16:50,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:16:50,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:16:50,852 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 -> 0a45241a50bca97d16f2ca30787e76783488e633dbd3fde1131a60622cf8ee85 [2025-02-06 05:16:51,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:16:51,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:16:51,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:16:51,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:16:51,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:16:51,064 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_pop_front_harness.i [2025-02-06 05:16:52,161 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3e32c69/b3edec1e7ef14c1383b4ace43ad97cb7/FLAG1b99cc1cc [2025-02-06 05:16:52,633 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:16:52,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_pop_front_harness.i [2025-02-06 05:16:52,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3e32c69/b3edec1e7ef14c1383b4ace43ad97cb7/FLAG1b99cc1cc [2025-02-06 05:16:52,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd3e32c69/b3edec1e7ef14c1383b4ace43ad97cb7 [2025-02-06 05:16:52,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:16:52,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:16:52,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:52,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:16:52,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:16:52,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:52" (1/1) ... [2025-02-06 05:16:52,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b28366c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:52, skipping insertion in model container [2025-02-06 05:16:52,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:52" (1/1) ... [2025-02-06 05:16:52,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:16:52,925 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_pop_front_harness.i[4499,4512] [2025-02-06 05:16:52,931 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_pop_front_harness.i[4559,4572] [2025-02-06 05:16:53,336 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,337 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,337 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,338 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,353 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,355 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,356 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,360 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,361 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,658 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_pop_front_harness.i[150662,150675] [2025-02-06 05:16:53,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:53,672 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:16:53,681 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_pop_front_harness.i[4499,4512] [2025-02-06 05:16:53,681 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_pop_front_harness.i[4559,4572] [2025-02-06 05:16:53,710 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,711 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,711 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,711 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,711 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,721 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,722 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,723 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,723 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,724 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:53,801 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_pop_front_harness.i[150662,150675] [2025-02-06 05:16:53,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:53,921 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:16:53,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53 WrapperNode [2025-02-06 05:16:53,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:53,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:53,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:16:53,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:16:53,926 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:16:53" (1/1) ... [2025-02-06 05:16:53,967 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:16:53" (1/1) ... [2025-02-06 05:16:53,998 INFO L138 Inliner]: procedures = 668, calls = 1044, calls flagged for inlining = 53, calls inlined = 8, statements flattened = 219 [2025-02-06 05:16:53,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:53,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:16:53,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:16:53,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:16:54,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,039 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 9 writes are split as follows [0, 0, 9]. [2025-02-06 05:16:54,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,049 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:16:54,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:16:54,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:16:54,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:16:54,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (1/1) ... [2025-02-06 05:16:54,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:54,103 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:16:54,105 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:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-06 05:16:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2025-02-06 05:16:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:16:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:16:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:16:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2025-02-06 05:16:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:16:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2025-02-06 05:16:54,122 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:54,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2025-02-06 05:16:54,123 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:16:54,123 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2025-02-06 05:16:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:16:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:16:54,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:16:54,303 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:16:54,306 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:16:54,347 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:16:54,407 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L266: havoc #t~nondet9; [2025-02-06 05:16:54,446 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:16:54,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4700: havoc #t~ret311#1; [2025-02-06 05:16:54,603 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4685: havoc #t~mem302.base, #t~mem302.offset; [2025-02-06 05:16:54,642 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-02-06 05:16:54,642 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:16:54,649 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:16:54,649 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:16:54,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:54 BoogieIcfgContainer [2025-02-06 05:16:54,649 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:16:54,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:16:54,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:16:54,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:16:54,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:16:52" (1/3) ... [2025-02-06 05:16:54,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d23ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:54, skipping insertion in model container [2025-02-06 05:16:54,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:53" (2/3) ... [2025-02-06 05:16:54,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d23ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:54, skipping insertion in model container [2025-02-06 05:16:54,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:54" (3/3) ... [2025-02-06 05:16:54,656 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_front_harness.i [2025-02-06 05:16:54,665 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:16:54,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_pop_front_harness.i that has 13 procedures, 143 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-06 05:16:54,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:16:54,718 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;@797e93ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:16:54,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:16:54,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 88 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 05:16:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 05:16:54,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:54,728 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:54,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash -670247900, now seen corresponding path program 1 times [2025-02-06 05:16:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:54,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042601826] [2025-02-06 05:16:54,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:54,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:54,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:54,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:54,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:54,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 05:16:55,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:55,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042601826] [2025-02-06 05:16:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042601826] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:55,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542043492] [2025-02-06 05:16:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:55,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:55,047 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:16:55,048 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:16:55,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:55,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:55,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:55,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:55,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 05:16:55,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 05:16:55,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:16:55,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542043492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:16:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 05:16:55,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413530737] [2025-02-06 05:16:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:55,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:16:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:55,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:16:55,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:16:55,274 INFO L87 Difference]: Start difference. First operand has 135 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 88 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:16:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:55,308 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2025-02-06 05:16:55,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:16:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2025-02-06 05:16:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:55,314 INFO L225 Difference]: With dead ends: 262 [2025-02-06 05:16:55,315 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 05:16:55,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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:16:55,319 INFO L435 NwaCegarLoop]: 181 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, 181 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:16:55,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 05:16:55,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 05:16:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 83 states have internal predecessors, (103), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 05:16:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-02-06 05:16:55,358 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 118 [2025-02-06 05:16:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:55,358 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-02-06 05:16:55,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 05:16:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-02-06 05:16:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 05:16:55,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:55,360 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:55,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 05:16:55,565 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:16:55,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1007758325, now seen corresponding path program 1 times [2025-02-06 05:16:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647447043] [2025-02-06 05:16:55,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:55,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-02-06 05:16:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647447043] [2025-02-06 05:16:56,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647447043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481301222] [2025-02-06 05:16:56,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:56,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:56,226 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:16:56,227 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:16:56,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 05:16:56,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 05:16:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-02-06 05:16:56,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:56,574 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 14 treesize of output 15 [2025-02-06 05:16:56,582 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:16:58,370 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 05:16:58,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 05:16:58,378 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-06 05:16:58,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 13 [2025-02-06 05:16:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 81 proven. 28 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-06 05:16:58,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:11,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2025-02-06 05:17:11,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:11,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:11,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-02-06 05:17:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-02-06 05:17:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481301222] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:11,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:17:11,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 17] total 34 [2025-02-06 05:17:11,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611713616] [2025-02-06 05:17:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 05:17:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:11,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 05:17:11,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1013, Unknown=3, NotChecked=0, Total=1122 [2025-02-06 05:17:11,287 INFO L87 Difference]: Start difference. First operand 130 states and 176 transitions. Second operand has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-06 05:17:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:12,036 INFO L93 Difference]: Finished difference Result 246 states and 337 transitions. [2025-02-06 05:17:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 05:17:12,036 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) Word has length 118 [2025-02-06 05:17:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:12,038 INFO L225 Difference]: With dead ends: 246 [2025-02-06 05:17:12,038 INFO L226 Difference]: Without dead ends: 131 [2025-02-06 05:17:12,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 192 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=129, Invalid=1274, Unknown=3, NotChecked=0, Total=1406 [2025-02-06 05:17:12,040 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 9 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2266 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:12,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2266 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:17:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-06 05:17:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-06 05:17:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 84 states have internal predecessors, (104), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 05:17:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2025-02-06 05:17:12,050 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 118 [2025-02-06 05:17:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:12,051 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2025-02-06 05:17:12,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 8 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-06 05:17:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2025-02-06 05:17:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 05:17:12,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:12,055 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:12,062 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:12,256 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:12,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:12,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1934701378, now seen corresponding path program 1 times [2025-02-06 05:17:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188404034] [2025-02-06 05:17:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:12,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 05:17:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 05:17:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-06 05:17:12,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188404034] [2025-02-06 05:17:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188404034] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851156053] [2025-02-06 05:17:12,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:12,655 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:12,657 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:12,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 05:17:12,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 05:17:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:12,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:12,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 05:17:12,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:12,827 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 6 treesize of output 5 [2025-02-06 05:17:12,917 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:12,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-02-06 05:17:12,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:12,966 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:12,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:12,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-02-06 05:17:12,986 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:17:12,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2025-02-06 05:17:12,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:12,999 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 13 treesize of output 7 [2025-02-06 05:17:13,025 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 05:17:13,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2025-02-06 05:17:13,035 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-06 05:17:13,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 05:17:13,044 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 11 treesize of output 11 [2025-02-06 05:17:13,104 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2025-02-06 05:17:13,104 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 119 [2025-02-06 05:17:13,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:13,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:13,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 90 [2025-02-06 05:17:13,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:13,119 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 45 treesize of output 40 [2025-02-06 05:17:13,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-02-06 05:17:13,129 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 57 treesize of output 22 [2025-02-06 05:17:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 114 proven. 17 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-06 05:17:14,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:14,506 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_pop_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_246 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_246))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_244 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_244))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2025-02-06 05:17:14,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:14,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:14,646 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:17:14,647 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 299 treesize of output 286 [2025-02-06 05:17:14,655 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:14,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:14,707 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2025-02-06 05:17:14,708 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 239 treesize of output 268 [2025-02-06 05:17:14,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,724 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 298 treesize of output 296 [2025-02-06 05:17:14,732 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 255 treesize of output 243 [2025-02-06 05:17:14,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,746 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 350 treesize of output 324 [2025-02-06 05:17:14,756 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 291 treesize of output 279 [2025-02-06 05:17:14,781 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:15,084 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:15,232 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 05:17:15,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:15,241 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 235 treesize of output 233 [2025-02-06 05:17:15,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:15,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 274 [2025-02-06 05:17:16,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851156053] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:16,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:17:16,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2025-02-06 05:17:16,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492843313] [2025-02-06 05:17:16,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:16,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 05:17:16,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:16,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 05:17:16,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=441, Unknown=2, NotChecked=42, Total=552 [2025-02-06 05:17:16,121 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 16 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2025-02-06 05:17:17,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:17,724 INFO L93 Difference]: Finished difference Result 336 states and 463 transitions. [2025-02-06 05:17:17,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 05:17:17,724 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) Word has length 119 [2025-02-06 05:17:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:17,729 INFO L225 Difference]: With dead ends: 336 [2025-02-06 05:17:17,729 INFO L226 Difference]: Without dead ends: 222 [2025-02-06 05:17:17,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 202 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=1292, Unknown=2, NotChecked=74, Total=1560 [2025-02-06 05:17:17,731 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 294 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:17,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1412 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 05:17:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-06 05:17:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2025-02-06 05:17:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 139 states have (on average 1.2661870503597121) internal successors, (176), 144 states have internal predecessors, (176), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (66), 57 states have call predecessors, (66), 59 states have call successors, (66) [2025-02-06 05:17:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 302 transitions. [2025-02-06 05:17:17,761 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 302 transitions. Word has length 119 [2025-02-06 05:17:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 302 transitions. [2025-02-06 05:17:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 7 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (29), 7 states have call predecessors, (29), 7 states have call successors, (29) [2025-02-06 05:17:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 302 transitions. [2025-02-06 05:17:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 05:17:17,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:17,763 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:17,770 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:17,963 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:17,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:17,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:17,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1719902816, now seen corresponding path program 1 times [2025-02-06 05:17:17,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:17,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29207233] [2025-02-06 05:17:17,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:17,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 05:17:17,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 05:17:17,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:17,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:17:18,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29207233] [2025-02-06 05:17:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29207233] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211492491] [2025-02-06 05:17:18,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:18,169 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:18,171 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:18,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 05:17:18,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 05:17:18,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:18,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:18,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 05:17:18,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:18,425 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-06 05:17:18,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211492491] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:18,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2025-02-06 05:17:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286259731] [2025-02-06 05:17:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:18,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 05:17:18,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:18,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 05:17:18,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-06 05:17:18,426 INFO L87 Difference]: Start difference. First operand 219 states and 302 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:17:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:18,642 INFO L93 Difference]: Finished difference Result 420 states and 577 transitions. [2025-02-06 05:17:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 05:17:18,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 120 [2025-02-06 05:17:18,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:18,645 INFO L225 Difference]: With dead ends: 420 [2025-02-06 05:17:18,645 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 05:17:18,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-02-06 05:17:18,646 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:18,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 887 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:17:18,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 05:17:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2025-02-06 05:17:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 139 states have (on average 1.2517985611510791) internal successors, (174), 144 states have internal predecessors, (174), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (66), 57 states have call predecessors, (66), 59 states have call successors, (66) [2025-02-06 05:17:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 300 transitions. [2025-02-06 05:17:18,665 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 300 transitions. Word has length 120 [2025-02-06 05:17:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:18,666 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 300 transitions. [2025-02-06 05:17:18,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:17:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 300 transitions. [2025-02-06 05:17:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 05:17:18,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:18,667 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:18,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 05:17:18,868 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:18,868 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1395449720, now seen corresponding path program 1 times [2025-02-06 05:17:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:18,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233126279] [2025-02-06 05:17:18,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:18,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 05:17:18,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 05:17:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:17:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233126279] [2025-02-06 05:17:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233126279] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933689705] [2025-02-06 05:17:19,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:19,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:19,162 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:17:19,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 05:17:19,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 05:17:19,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 05:17:19,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:19,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:19,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 05:17:19,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-06 05:17:19,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933689705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:19,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-02-06 05:17:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3976539] [2025-02-06 05:17:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:19,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 05:17:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:19,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 05:17:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-02-06 05:17:19,418 INFO L87 Difference]: Start difference. First operand 219 states and 300 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:17:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:19,698 INFO L93 Difference]: Finished difference Result 432 states and 593 transitions. [2025-02-06 05:17:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 05:17:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) Word has length 122 [2025-02-06 05:17:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:19,700 INFO L225 Difference]: With dead ends: 432 [2025-02-06 05:17:19,700 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 05:17:19,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-02-06 05:17:19,701 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 217 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 998 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:17:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 05:17:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2025-02-06 05:17:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 141 states have (on average 1.24822695035461) internal successors, (176), 146 states have internal predecessors, (176), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (66), 57 states have call predecessors, (66), 59 states have call successors, (66) [2025-02-06 05:17:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 302 transitions. [2025-02-06 05:17:19,721 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 302 transitions. Word has length 122 [2025-02-06 05:17:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 302 transitions. [2025-02-06 05:17:19,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 5 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 5 states have call successors, (15) [2025-02-06 05:17:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 302 transitions. [2025-02-06 05:17:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 05:17:19,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:19,724 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2025-02-06 05:17:19,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 05:17:19,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:19,924 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:19,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1124824408, now seen corresponding path program 1 times [2025-02-06 05:17:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946826719] [2025-02-06 05:17:19,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:19,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 05:17:19,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 05:17:19,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:19,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-02-06 05:17:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946826719] [2025-02-06 05:17:20,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946826719] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:20,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468795559] [2025-02-06 05:17:20,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:20,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:17:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 05:17:20,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 05:17:20,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 05:17:20,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:20,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:20,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 05:17:20,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-06 05:17:20,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:20,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468795559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:20,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-06 05:17:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557052078] [2025-02-06 05:17:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 05:17:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:20,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 05:17:20,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:17:20,362 INFO L87 Difference]: Start difference. First operand 221 states and 302 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:17:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:20,385 INFO L93 Difference]: Finished difference Result 422 states and 583 transitions. [2025-02-06 05:17:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 05:17:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 123 [2025-02-06 05:17:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:20,388 INFO L225 Difference]: With dead ends: 422 [2025-02-06 05:17:20,388 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 05:17:20,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 05:17:20,389 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:20,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 339 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 05:17:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2025-02-06 05:17:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 148 states have internal predecessors, (178), 60 states have call successors, (60), 17 states have call predecessors, (60), 19 states have return successors, (66), 57 states have call predecessors, (66), 59 states have call successors, (66) [2025-02-06 05:17:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 304 transitions. [2025-02-06 05:17:20,406 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 304 transitions. Word has length 123 [2025-02-06 05:17:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:20,406 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 304 transitions. [2025-02-06 05:17:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 05:17:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 304 transitions. [2025-02-06 05:17:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 05:17:20,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:20,407 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:17:20,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:20,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 05:17:20,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:20,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash -291261063, now seen corresponding path program 1 times [2025-02-06 05:17:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:20,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433723646] [2025-02-06 05:17:20,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:20,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 05:17:20,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 05:17:20,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:20,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-02-06 05:17:20,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433723646] [2025-02-06 05:17:20,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433723646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:20,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456026992] [2025-02-06 05:17:20,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:20,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:20,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:20,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 05:17:20,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 05:17:21,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 05:17:21,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 05:17:21,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:21,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:21,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 05:17:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 116 proven. 6 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 05:17:21,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-02-06 05:17:21,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456026992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:21,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:21,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 9] total 19 [2025-02-06 05:17:21,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032995694] [2025-02-06 05:17:21,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:21,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 05:17:21,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:21,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 05:17:21,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-02-06 05:17:21,338 INFO L87 Difference]: Start difference. First operand 223 states and 304 transitions. Second operand has 19 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 8 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (31), 6 states have call predecessors, (31), 8 states have call successors, (31) [2025-02-06 05:17:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:21,787 INFO L93 Difference]: Finished difference Result 426 states and 581 transitions. [2025-02-06 05:17:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 05:17:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 8 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (31), 6 states have call predecessors, (31), 8 states have call successors, (31) Word has length 131 [2025-02-06 05:17:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:21,789 INFO L225 Difference]: With dead ends: 426 [2025-02-06 05:17:21,789 INFO L226 Difference]: Without dead ends: 229 [2025-02-06 05:17:21,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-02-06 05:17:21,790 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 171 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:21,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1974 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 05:17:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-06 05:17:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 221. [2025-02-06 05:17:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 142 states have (on average 1.2394366197183098) internal successors, (176), 146 states have internal predecessors, (176), 60 states have call successors, (60), 17 states have call predecessors, (60), 18 states have return successors, (63), 57 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-06 05:17:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 299 transitions. [2025-02-06 05:17:21,805 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 299 transitions. Word has length 131 [2025-02-06 05:17:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:21,806 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 299 transitions. [2025-02-06 05:17:21,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 6.428571428571429) internal successors, (90), 15 states have internal predecessors, (90), 8 states have call successors, (31), 3 states have call predecessors, (31), 6 states have return successors, (31), 6 states have call predecessors, (31), 8 states have call successors, (31) [2025-02-06 05:17:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 299 transitions. [2025-02-06 05:17:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 05:17:21,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:21,807 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 05:17:21,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:22,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:22,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:22,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:22,011 INFO L85 PathProgramCache]: Analyzing trace with hash -376453310, now seen corresponding path program 1 times [2025-02-06 05:17:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:22,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286089124] [2025-02-06 05:17:22,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:22,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:22,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:22,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:22,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:22,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2025-02-06 05:17:22,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:22,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286089124] [2025-02-06 05:17:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286089124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:22,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746286402] [2025-02-06 05:17:22,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:22,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:22,378 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 05:17:22,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:22,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:22,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-06 05:17:22,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:22,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 1 [2025-02-06 05:17:22,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 1 [2025-02-06 05:17:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-06 05:17:22,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-02-06 05:17:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746286402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:23,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 8] total 24 [2025-02-06 05:17:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527129245] [2025-02-06 05:17:23,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:23,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 05:17:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:23,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 05:17:23,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2025-02-06 05:17:23,040 INFO L87 Difference]: Start difference. First operand 221 states and 299 transitions. Second operand has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 8 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (35), 7 states have call predecessors, (35), 8 states have call successors, (35) [2025-02-06 05:17:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:23,829 INFO L93 Difference]: Finished difference Result 526 states and 745 transitions. [2025-02-06 05:17:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 05:17:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 8 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (35), 7 states have call predecessors, (35), 8 states have call successors, (35) Word has length 147 [2025-02-06 05:17:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:23,832 INFO L225 Difference]: With dead ends: 526 [2025-02-06 05:17:23,832 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 05:17:23,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 05:17:23,836 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 147 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:23,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 2488 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:17:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 05:17:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 267. [2025-02-06 05:17:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.2527472527472527) internal successors, (228), 188 states have internal predecessors, (228), 62 states have call successors, (62), 19 states have call predecessors, (62), 22 states have return successors, (73), 59 states have call predecessors, (73), 61 states have call successors, (73) [2025-02-06 05:17:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2025-02-06 05:17:23,860 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 147 [2025-02-06 05:17:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:23,860 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2025-02-06 05:17:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.956521739130435) internal successors, (114), 23 states have internal predecessors, (114), 8 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (35), 7 states have call predecessors, (35), 8 states have call successors, (35) [2025-02-06 05:17:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2025-02-06 05:17:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 05:17:23,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:23,862 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:24,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:24,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash -732988606, now seen corresponding path program 1 times [2025-02-06 05:17:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808828847] [2025-02-06 05:17:24,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:24,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:24,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:24,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-02-06 05:17:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808828847] [2025-02-06 05:17:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808828847] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117974102] [2025-02-06 05:17:24,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:24,146 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 05:17:24,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:24,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:24,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 05:17:24,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-02-06 05:17:24,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117974102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:24,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:24,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-06 05:17:24,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012128587] [2025-02-06 05:17:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:24,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:17:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:24,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:17:24,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:17:24,340 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:17:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:24,368 INFO L93 Difference]: Finished difference Result 508 states and 699 transitions. [2025-02-06 05:17:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:17:24,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-06 05:17:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:24,372 INFO L225 Difference]: With dead ends: 508 [2025-02-06 05:17:24,372 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 05:17:24,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:17:24,373 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:24,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 513 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 05:17:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2025-02-06 05:17:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 188 states have internal predecessors, (226), 62 states have call successors, (62), 19 states have call predecessors, (62), 22 states have return successors, (73), 59 states have call predecessors, (73), 61 states have call successors, (73) [2025-02-06 05:17:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 361 transitions. [2025-02-06 05:17:24,396 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 361 transitions. Word has length 147 [2025-02-06 05:17:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:24,397 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 361 transitions. [2025-02-06 05:17:24,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:17:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 361 transitions. [2025-02-06 05:17:24,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 05:17:24,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:24,399 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 05:17:24,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:24,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:24,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1073831134, now seen corresponding path program 1 times [2025-02-06 05:17:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:24,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013611989] [2025-02-06 05:17:24,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:24,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:24,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:24,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:24,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:24,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-02-06 05:17:24,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013611989] [2025-02-06 05:17:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013611989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356260207] [2025-02-06 05:17:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:24,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:24,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:24,699 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 05:17:24,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 05:17:24,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 05:17:24,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:24,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:24,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 05:17:24,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-06 05:17:24,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 05:17:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356260207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:17:24,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 05:17:24,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-02-06 05:17:24,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277092582] [2025-02-06 05:17:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:17:24,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:17:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:24,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:17:24,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:17:24,910 INFO L87 Difference]: Start difference. First operand 267 states and 361 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:17:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:24,936 INFO L93 Difference]: Finished difference Result 506 states and 697 transitions. [2025-02-06 05:17:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:17:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2025-02-06 05:17:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:24,938 INFO L225 Difference]: With dead ends: 506 [2025-02-06 05:17:24,938 INFO L226 Difference]: Without dead ends: 267 [2025-02-06 05:17:24,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:17:24,939 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:24,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:17:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-02-06 05:17:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-02-06 05:17:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 176 states have (on average 1.2272727272727273) internal successors, (216), 182 states have internal predecessors, (216), 62 states have call successors, (62), 19 states have call predecessors, (62), 22 states have return successors, (73), 59 states have call predecessors, (73), 61 states have call successors, (73) [2025-02-06 05:17:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 351 transitions. [2025-02-06 05:17:24,959 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 351 transitions. Word has length 147 [2025-02-06 05:17:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 351 transitions. [2025-02-06 05:17:24,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 05:17:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 351 transitions. [2025-02-06 05:17:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-06 05:17:24,961 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:24,961 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 05:17:24,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 05:17:25,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 05:17:25,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:25,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1791039434, now seen corresponding path program 1 times [2025-02-06 05:17:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79346992] [2025-02-06 05:17:25,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:25,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:25,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 05:17:25,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 05:17:25,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:25,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 32 proven. 35 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-06 05:17:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79346992] [2025-02-06 05:17:26,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79346992] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:26,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356553401] [2025-02-06 05:17:26,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:17:26,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:26,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:26,022 INFO L229 MonitoredProcess]: Starting monitored process 12 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,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 05:17:26,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-06 05:17:26,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-06 05:17:26,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:26,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:26,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-02-06 05:17:26,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:26,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:26,487 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 21 treesize of output 1 [2025-02-06 05:17:26,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 05:17:26,492 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 22 treesize of output 22 [2025-02-06 05:17:26,494 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 12 treesize of output 1 [2025-02-06 05:17:30,526 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_31| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_31|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_31|) 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_31|))) is different from true [2025-02-06 05:17:34,580 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_32| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_32|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_32|) 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_harness_~#list~0#1.base_BEFORE_CALL_32|))) is different from true [2025-02-06 05:17:38,643 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_25| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_25|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_25|) 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_25|))) is different from true [2025-02-06 05:17:42,709 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_26| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_26|) (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_26|) 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_26|))) is different from true [2025-02-06 05:17:46,753 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_27| Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_27|) 24)) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_27|) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_27|))) is different from true [2025-02-06 05:17:50,860 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_28| Int)) (and (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_28|) 24) 2) |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_28|) (<= 2 |v_ULTIMATE.start_aws_linked_list_pop_front_~list#1.base_BEFORE_CALL_28|))) is different from true [2025-02-06 05:17:54,924 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_14| Int)) (and (<= (+ 2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_14|) 24)) |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_14|) (<= 2 |v_ULTIMATE.start_aws_linked_list_front_~list#1.base_BEFORE_CALL_14|))) is different from true