./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_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_node_reset_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 14ecb1bdeb89e6f16cc91bd9d320557c2f2576024bfb946541efab4252b9f995 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 05:16:27,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 05:16:27,583 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:27,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 05:16:27,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 05:16:27,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 05:16:27,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 05:16:27,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 05:16:27,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 05:16:27,613 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 05:16:27,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 05:16:27,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 05:16:27,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 05:16:27,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 05:16:27,613 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 05:16:27,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 05:16:27,614 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 05:16:27,614 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:27,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 05:16:27,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 05:16:27,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 05:16:27,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 05:16:27,616 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 -> 14ecb1bdeb89e6f16cc91bd9d320557c2f2576024bfb946541efab4252b9f995 [2025-02-06 05:16:27,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 05:16:27,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 05:16:27,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 05:16:27,939 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 05:16:27,939 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 05:16:27,940 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_node_reset_harness.i [2025-02-06 05:16:29,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34a46888c/656d8db4c8f24e368bd8980c1447798d/FLAG581d6e141 [2025-02-06 05:16:29,655 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 05:16:29,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness.i [2025-02-06 05:16:29,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34a46888c/656d8db4c8f24e368bd8980c1447798d/FLAG581d6e141 [2025-02-06 05:16:29,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/34a46888c/656d8db4c8f24e368bd8980c1447798d [2025-02-06 05:16:29,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 05:16:29,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 05:16:29,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:29,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 05:16:29,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 05:16:29,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:29" (1/1) ... [2025-02-06 05:16:29,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284b25f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:29, skipping insertion in model container [2025-02-06 05:16:29,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 05:16:29" (1/1) ... [2025-02-06 05:16:29,788 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 05:16:30,047 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_node_reset_harness.i[4500,4513] [2025-02-06 05:16:30,055 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_node_reset_harness.i[4560,4573] [2025-02-06 05:16:30,787 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,787 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,788 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,789 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,789 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,800 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,801 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,802 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,803 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,806 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,807 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,807 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:30,807 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,280 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_node_reset_harness.i[150268,150281] [2025-02-06 05:16:31,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:31,303 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 05:16:31,314 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_node_reset_harness.i[4500,4513] [2025-02-06 05:16:31,315 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_node_reset_harness.i[4560,4573] [2025-02-06 05:16:31,370 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,371 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,372 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,379 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,380 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,381 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,381 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,382 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,382 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,383 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,383 WARN L1731 CHandler]: Possible shadowing of function index [2025-02-06 05:16:31,483 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_node_reset_harness.i[150268,150281] [2025-02-06 05:16:31,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 05:16:31,643 INFO L204 MainTranslator]: Completed translation [2025-02-06 05:16:31,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:31 WrapperNode [2025-02-06 05:16:31,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 05:16:31,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:31,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 05:16:31,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 05:16:31,649 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:31" (1/1) ... [2025-02-06 05:16:31,722 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:31" (1/1) ... [2025-02-06 05:16:31,761 INFO L138 Inliner]: procedures = 668, calls = 1032, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 27 [2025-02-06 05:16:31,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 05:16:31,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 05:16:31,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 05:16:31,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 05:16:31,770 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:31" (1/1) ... [2025-02-06 05:16:31,770 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:31" (1/1) ... [2025-02-06 05:16:31,773 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:31" (1/1) ... [2025-02-06 05:16:31,788 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-02-06 05:16:31,788 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:31" (1/1) ... [2025-02-06 05:16:31,789 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:31" (1/1) ... [2025-02-06 05:16:31,796 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:31" (1/1) ... [2025-02-06 05:16:31,797 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:31" (1/1) ... [2025-02-06 05:16:31,803 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:31" (1/1) ... [2025-02-06 05:16:31,804 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:31" (1/1) ... [2025-02-06 05:16:31,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 05:16:31,809 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 05:16:31,809 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 05:16:31,809 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 05:16:31,810 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:31" (1/1) ... [2025-02-06 05:16:31,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 05:16:31,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:31,856 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:31,860 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:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_reset [2025-02-06 05:16:31,878 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_reset [2025-02-06 05:16:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-02-06 05:16:31,878 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-02-06 05:16:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 05:16:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 05:16:31,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 05:16:31,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 05:16:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 05:16:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 05:16:31,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 05:16:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 05:16:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 05:16:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 05:16:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 05:16:32,118 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 05:16:32,120 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 05:16:32,344 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-06 05:16:32,344 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 05:16:32,353 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 05:16:32,354 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 05:16:32,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:32 BoogieIcfgContainer [2025-02-06 05:16:32,354 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 05:16:32,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 05:16:32,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 05:16:32,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 05:16:32,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 05:16:29" (1/3) ... [2025-02-06 05:16:32,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e86a3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:32, skipping insertion in model container [2025-02-06 05:16:32,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 05:16:31" (2/3) ... [2025-02-06 05:16:32,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e86a3fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 05:16:32, skipping insertion in model container [2025-02-06 05:16:32,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 05:16:32" (3/3) ... [2025-02-06 05:16:32,365 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness.i [2025-02-06 05:16:32,375 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 05:16:32,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_node_reset_harness.i that has 8 procedures, 48 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-06 05:16:32,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 05:16:32,429 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;@622d0b5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 05:16:32,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 05:16:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-06 05:16:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 05:16:32,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:32,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:32,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:32,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 842897049, now seen corresponding path program 1 times [2025-02-06 05:16:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:32,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030594378] [2025-02-06 05:16:32,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:32,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:32,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 05:16:32,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 05:16:32,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:32,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030594378] [2025-02-06 05:16:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030594378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:32,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:16:32,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 05:16:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277639377] [2025-02-06 05:16:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:32,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 05:16:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:32,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 05:16:32,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:16:32,737 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 05:16:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:32,757 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2025-02-06 05:16:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 05:16:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-02-06 05:16:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:32,765 INFO L225 Difference]: With dead ends: 73 [2025-02-06 05:16:32,765 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 05:16:32,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 05:16:32,774 INFO L435 NwaCegarLoop]: 44 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, 44 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:32,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 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:32,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 05:16:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 05:16:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-06 05:16:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-02-06 05:16:32,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2025-02-06 05:16:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:32,806 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-02-06 05:16:32,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 05:16:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-02-06 05:16:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-06 05:16:32,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:32,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 05:16:32,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash 153354151, now seen corresponding path program 1 times [2025-02-06 05:16:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282924903] [2025-02-06 05:16:32,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:32,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:32,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-06 05:16:32,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-06 05:16:32,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:33,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282924903] [2025-02-06 05:16:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282924903] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:16:33,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 05:16:33,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816963513] [2025-02-06 05:16:33,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:33,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 05:16:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:33,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 05:16:33,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 05:16:33,279 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 05:16:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:33,338 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-06 05:16:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 05:16:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-02-06 05:16:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:33,340 INFO L225 Difference]: With dead ends: 45 [2025-02-06 05:16:33,341 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 05:16:33,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 05:16:33,343 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:33,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 05:16:33,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-02-06 05:16:33,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 05:16:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-02-06 05:16:33,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-02-06 05:16:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:33,358 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-02-06 05:16:33,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 05:16:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-02-06 05:16:33,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 05:16:33,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:33,360 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 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:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 05:16:33,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:33,362 INFO L85 PathProgramCache]: Analyzing trace with hash -643962008, now seen corresponding path program 1 times [2025-02-06 05:16:33,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254930758] [2025-02-06 05:16:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 05:16:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 05:16:33,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:33,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:33,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:33,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254930758] [2025-02-06 05:16:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254930758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 05:16:33,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 05:16:33,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 05:16:33,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15858847] [2025-02-06 05:16:33,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 05:16:33,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 05:16:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:33,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 05:16:33,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 05:16:33,600 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:16:33,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:33,624 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-02-06 05:16:33,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 05:16:33,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-02-06 05:16:33,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:33,626 INFO L225 Difference]: With dead ends: 72 [2025-02-06 05:16:33,626 INFO L226 Difference]: Without dead ends: 43 [2025-02-06 05:16:33,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:16:33,628 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:33,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 05:16:33,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-06 05:16:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-02-06 05:16:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-06 05:16:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-02-06 05:16:33,642 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2025-02-06 05:16:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-02-06 05:16:33,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 05:16:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-02-06 05:16:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 05:16:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:33,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:33,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 05:16:33,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:33,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1349990956, now seen corresponding path program 1 times [2025-02-06 05:16:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737934008] [2025-02-06 05:16:33,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:33,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 05:16:33,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 05:16:33,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:33,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737934008] [2025-02-06 05:16:33,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737934008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698973336] [2025-02-06 05:16:33,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:33,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:33,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:33,905 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:33,908 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:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 05:16:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 05:16:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:34,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 05:16:34,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:34,188 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 11 treesize of output 7 [2025-02-06 05:16:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:34,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:35,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 12 [2025-02-06 05:16:35,018 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 16 treesize of output 14 [2025-02-06 05:16:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:35,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698973336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:35,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:35,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 10] total 25 [2025-02-06 05:16:35,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922194148] [2025-02-06 05:16:35,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:35,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 05:16:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:35,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 05:16:35,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=534, Unknown=0, NotChecked=0, Total=600 [2025-02-06 05:16:35,082 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:35,869 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2025-02-06 05:16:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 05:16:35,870 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 28 [2025-02-06 05:16:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:35,871 INFO L225 Difference]: With dead ends: 77 [2025-02-06 05:16:35,871 INFO L226 Difference]: Without dead ends: 48 [2025-02-06 05:16:35,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 05:16:35,872 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 61 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:35,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 373 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 05:16:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-06 05:16:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-06 05:16:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2025-02-06 05:16:35,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 28 [2025-02-06 05:16:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2025-02-06 05:16:35,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2025-02-06 05:16:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 05:16:35,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:35,892 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 05:16:35,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 05:16:36,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:36,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:36,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash -113394169, now seen corresponding path program 1 times [2025-02-06 05:16:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:36,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85107856] [2025-02-06 05:16:36,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:36,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 05:16:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 05:16:36,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:36,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 05:16:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:36,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85107856] [2025-02-06 05:16:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85107856] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927213161] [2025-02-06 05:16:36,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 05:16:36,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:36,409 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:36,412 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:36,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 05:16:36,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 05:16:36,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:16:36,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:36,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 05:16:36,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:36,630 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 11 treesize of output 7 [2025-02-06 05:16:36,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:16:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:37,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:37,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 20 [2025-02-06 05:16:37,776 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 27 treesize of output 23 [2025-02-06 05:16:37,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927213161] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:37,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 13] total 32 [2025-02-06 05:16:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746417841] [2025-02-06 05:16:37,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 05:16:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:37,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 05:16:37,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-02-06 05:16:37,872 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:38,986 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2025-02-06 05:16:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 05:16:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 31 [2025-02-06 05:16:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:38,988 INFO L225 Difference]: With dead ends: 86 [2025-02-06 05:16:38,988 INFO L226 Difference]: Without dead ends: 53 [2025-02-06 05:16:38,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=2137, Unknown=0, NotChecked=0, Total=2352 [2025-02-06 05:16:38,990 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 68 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:38,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 445 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 05:16:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-06 05:16:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-02-06 05:16:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2025-02-06 05:16:39,005 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 31 [2025-02-06 05:16:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2025-02-06 05:16:39,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2025-02-06 05:16:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-06 05:16:39,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:39,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:39,015 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:16:39,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:39,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:39,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2054541522, now seen corresponding path program 2 times [2025-02-06 05:16:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495299324] [2025-02-06 05:16:39,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:16:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:39,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 05:16:39,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 05:16:39,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:16:39,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 05:16:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495299324] [2025-02-06 05:16:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495299324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859941991] [2025-02-06 05:16:39,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:16:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:39,478 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:16:39,480 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:16:39,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-02-06 05:16:39,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 05:16:39,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:16:39,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:39,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-06 05:16:39,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:39,626 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 13 treesize of output 9 [2025-02-06 05:16:39,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 05:16:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:40,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:41,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 41 [2025-02-06 05:16:41,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:41,324 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 45 treesize of output 37 [2025-02-06 05:16:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:41,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859941991] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:41,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:41,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 13] total 29 [2025-02-06 05:16:41,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746866763] [2025-02-06 05:16:41,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:41,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-06 05:16:41,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:41,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-06 05:16:41,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-02-06 05:16:41,402 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 05:16:42,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:42,170 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2025-02-06 05:16:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 05:16:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 34 [2025-02-06 05:16:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:42,172 INFO L225 Difference]: With dead ends: 95 [2025-02-06 05:16:42,172 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 05:16:42,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 05:16:42,174 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:42,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 466 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 05:16:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 05:16:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-02-06 05:16:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 40 states have internal predecessors, (47), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-02-06 05:16:42,189 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 34 [2025-02-06 05:16:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:42,191 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-02-06 05:16:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-06 05:16:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-02-06 05:16:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 05:16:42,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:42,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:42,201 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:16:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:42,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:42,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1164303739, now seen corresponding path program 3 times [2025-02-06 05:16:42,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:42,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770909742] [2025-02-06 05:16:42,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 05:16:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:42,408 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-06 05:16:42,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 37 statements. [2025-02-06 05:16:42,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 05:16:42,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:16:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770909742] [2025-02-06 05:16:42,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770909742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610580725] [2025-02-06 05:16:42,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 05:16:42,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:42,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:42,686 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:16:42,687 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:16:42,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-02-06 05:16:42,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 37 statements. [2025-02-06 05:16:42,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 05:16:42,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:42,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-06 05:16:42,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:42,920 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 11 treesize of output 7 [2025-02-06 05:16:42,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:16:42,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:42,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:16:43,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:43,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:16:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:16:43,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610580725] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:43,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 05:16:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 19 [2025-02-06 05:16:43,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550919400] [2025-02-06 05:16:43,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:43,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 05:16:43,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:43,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 05:16:43,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=460, Unknown=0, NotChecked=0, Total=506 [2025-02-06 05:16:43,340 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 05:16:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:43,737 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2025-02-06 05:16:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 05:16:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2025-02-06 05:16:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:43,739 INFO L225 Difference]: With dead ends: 92 [2025-02-06 05:16:43,739 INFO L226 Difference]: Without dead ends: 55 [2025-02-06 05:16:43,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 05:16:43,741 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:43,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 339 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 05:16:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-06 05:16:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-06 05:16:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.263157894736842) internal successors, (48), 41 states have internal predecessors, (48), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2025-02-06 05:16:43,752 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 37 [2025-02-06 05:16:43,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:43,752 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2025-02-06 05:16:43,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 05:16:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2025-02-06 05:16:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 05:16:43,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:43,753 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 05:16:43,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 05:16:43,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 05:16:43,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:43,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1152902641, now seen corresponding path program 4 times [2025-02-06 05:16:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404044913] [2025-02-06 05:16:43,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 05:16:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:43,976 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-06 05:16:44,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 05:16:44,011 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 05:16:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 05:16:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404044913] [2025-02-06 05:16:44,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404044913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:44,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990786543] [2025-02-06 05:16:44,269 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 05:16:44,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:44,272 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:16:44,274 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:16:44,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-02-06 05:16:44,468 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 05:16:44,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 05:16:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:44,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-02-06 05:16:44,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:44,559 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 11 treesize of output 7 [2025-02-06 05:16:44,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:16:44,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:44,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:16:44,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:44,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:16:44,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:44,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-06 05:16:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:45,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:46,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 38 [2025-02-06 05:16:46,500 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 58 treesize of output 54 [2025-02-06 05:16:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:46,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990786543] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:46,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:46,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 17] total 43 [2025-02-06 05:16:46,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732657851] [2025-02-06 05:16:46,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:46,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-06 05:16:46,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:46,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-06 05:16:46,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1631, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 05:16:46,569 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 40 states have internal predecessors, (73), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:48,067 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-02-06 05:16:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 05:16:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 40 states have internal predecessors, (73), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 38 [2025-02-06 05:16:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:48,069 INFO L225 Difference]: With dead ends: 103 [2025-02-06 05:16:48,069 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 05:16:48,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=359, Invalid=3801, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 05:16:48,071 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 94 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:48,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 578 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 05:16:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 05:16:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2025-02-06 05:16:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 44 states have internal predecessors, (53), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:48,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2025-02-06 05:16:48,083 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2025-02-06 05:16:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:48,083 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2025-02-06 05:16:48,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 40 states have internal predecessors, (73), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2025-02-06 05:16:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 05:16:48,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:48,085 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 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:48,093 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:16:48,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:48,285 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:48,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -274873884, now seen corresponding path program 5 times [2025-02-06 05:16:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862341084] [2025-02-06 05:16:48,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 05:16:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:48,302 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 5 equivalence classes. [2025-02-06 05:16:48,404 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 05:16:48,404 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 05:16:48,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-06 05:16:48,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:48,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862341084] [2025-02-06 05:16:48,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862341084] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:48,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933807992] [2025-02-06 05:16:48,843 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 05:16:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:48,845 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:16:48,847 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:16:48,939 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 5 equivalence classes. [2025-02-06 05:16:49,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 05:16:49,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-06 05:16:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:49,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 05:16:49,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:49,364 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 11 treesize of output 7 [2025-02-06 05:16:49,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:16:49,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:49,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:16:49,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:49,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:16:49,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:49,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-06 05:16:49,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:49,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-06 05:16:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:50,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:51,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 44 [2025-02-06 05:16:51,723 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 67 treesize of output 63 [2025-02-06 05:16:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933807992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:51,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:51,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24, 19] total 48 [2025-02-06 05:16:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275281396] [2025-02-06 05:16:51,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:51,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 05:16:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:51,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 05:16:51,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2067, Unknown=0, NotChecked=0, Total=2256 [2025-02-06 05:16:51,801 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 45 states have internal predecessors, (80), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:16:53,630 INFO L93 Difference]: Finished difference Result 110 states and 139 transitions. [2025-02-06 05:16:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 05:16:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 45 states have internal predecessors, (80), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 41 [2025-02-06 05:16:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:16:53,632 INFO L225 Difference]: With dead ends: 110 [2025-02-06 05:16:53,632 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 05:16:53,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=385, Invalid=4727, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 05:16:53,634 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 05:16:53,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 709 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 05:16:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 05:16:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2025-02-06 05:16:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:16:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2025-02-06 05:16:53,650 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 41 [2025-02-06 05:16:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:16:53,651 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2025-02-06 05:16:53,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 45 states have internal predecessors, (80), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:16:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2025-02-06 05:16:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 05:16:53,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:16:53,652 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 1, 1, 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:53,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 05:16:53,852 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,SelfDestructingSolverStorable8 [2025-02-06 05:16:53,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:16:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:16:53,853 INFO L85 PathProgramCache]: Analyzing trace with hash 730102383, now seen corresponding path program 6 times [2025-02-06 05:16:53,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:16:53,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122432370] [2025-02-06 05:16:53,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 05:16:53,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:16:53,871 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 6 equivalence classes. [2025-02-06 05:16:53,961 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 05:16:53,962 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 05:16:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:54,252 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 05:16:54,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:16:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122432370] [2025-02-06 05:16:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122432370] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:16:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080621291] [2025-02-06 05:16:54,254 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 05:16:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:16:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:16:54,256 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:16:54,259 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:16:54,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 6 equivalence classes. [2025-02-06 05:16:55,146 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 05:16:55,146 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-06 05:16:55,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:16:55,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-06 05:16:55,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:16:55,239 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 11 treesize of output 7 [2025-02-06 05:16:55,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:16:55,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:55,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:16:55,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:55,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:16:55,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:55,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-06 05:16:55,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:55,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-06 05:16:55,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:16:55,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-06 05:16:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 05:16:55,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:16:57,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 14 [2025-02-06 05:16:57,183 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 18 treesize of output 14 [2025-02-06 05:16:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:16:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080621291] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:16:57,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:16:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 23] total 46 [2025-02-06 05:16:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956004153] [2025-02-06 05:16:57,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:16:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 05:16:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:16:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 05:16:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 05:16:57,236 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 46 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:17:12,709 WARN L286 SmtUtils]: Spent 13.68s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 05:17:13,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 05:17:13,019 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-02-06 05:17:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 05:17:13,020 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 44 [2025-02-06 05:17:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:13,021 INFO L225 Difference]: With dead ends: 124 [2025-02-06 05:17:13,021 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 05:17:13,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=539, Invalid=5011, Unknown=0, NotChecked=0, Total=5550 [2025-02-06 05:17:13,022 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:13,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 693 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 05:17:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 05:17:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-02-06 05:17:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 50 states have internal predecessors, (63), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:17:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2025-02-06 05:17:13,041 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 44 [2025-02-06 05:17:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2025-02-06 05:17:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.7272727272727273) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (11), 4 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-06 05:17:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2025-02-06 05:17:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 05:17:13,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:13,044 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 1, 1, 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:13,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 05:17:13,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:13,249 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:13,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash 514330594, now seen corresponding path program 7 times [2025-02-06 05:17:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:13,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105428852] [2025-02-06 05:17:13,250 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 05:17:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 05:17:13,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 05:17:13,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:13,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-06 05:17:13,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105428852] [2025-02-06 05:17:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105428852] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:13,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310271348] [2025-02-06 05:17:13,646 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 05:17:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:13,648 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:13,651 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:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-06 05:17:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-06 05:17:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 05:17:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:13,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-02-06 05:17:13,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:14,087 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 11 treesize of output 7 [2025-02-06 05:17:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:17:14,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:17:14,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:17:14,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-06 05:17:14,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-06 05:17:14,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-06 05:17:14,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:14,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-02-06 05:17:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:17:15,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:18,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 58 treesize of output 56 [2025-02-06 05:17:18,414 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 85 treesize of output 81 [2025-02-06 05:17:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 13 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:17:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310271348] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:18,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:18,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 28, 23] total 58 [2025-02-06 05:17:18,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815463006] [2025-02-06 05:17:18,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:18,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-02-06 05:17:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:18,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-02-06 05:17:18,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3041, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 05:17:18,541 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [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 124 states and 162 transitions. [2025-02-06 05:17:21,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 05:17:21,788 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 47 [2025-02-06 05:17:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 05:17:21,789 INFO L225 Difference]: With dead ends: 124 [2025-02-06 05:17:21,789 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 05:17:21,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=517, Invalid=6793, Unknown=0, NotChecked=0, Total=7310 [2025-02-06 05:17:21,791 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 119 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 05:17:21,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 935 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 05:17:21,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 05:17:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2025-02-06 05:17:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 53 states have internal predecessors, (68), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-06 05:17:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2025-02-06 05:17:21,815 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 47 [2025-02-06 05:17:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 05:17:21,815 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2025-02-06 05:17:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.6491228070175439) internal successors, (94), 55 states have internal predecessors, (94), 6 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-02-06 05:17:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2025-02-06 05:17:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 05:17:21,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 05:17:21,820 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 7, 1, 1, 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,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 05:17:22,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:22,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 05:17:22,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 05:17:22,021 INFO L85 PathProgramCache]: Analyzing trace with hash 74104813, now seen corresponding path program 8 times [2025-02-06 05:17:22,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 05:17:22,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936900579] [2025-02-06 05:17:22,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:17:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 05:17:22,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 05:17:22,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 05:17:22,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:17:22,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-06 05:17:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 05:17:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936900579] [2025-02-06 05:17:22,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936900579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 05:17:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597391023] [2025-02-06 05:17:22,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 05:17:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 05:17:22,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 05:17:22,456 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:22,459 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:22,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-02-06 05:17:22,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 05:17:22,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 05:17:22,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 05:17:22,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-02-06 05:17:22,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 05:17:22,877 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 11 treesize of output 7 [2025-02-06 05:17:22,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 05:17:22,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:22,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2025-02-06 05:17:22,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:22,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 39 treesize of output 44 [2025-02-06 05:17:22,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:22,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2025-02-06 05:17:23,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:23,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-02-06 05:17:23,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:23,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 80 [2025-02-06 05:17:23,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 75 treesize of output 92 [2025-02-06 05:17:23,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 05:17:23,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 84 treesize of output 104 [2025-02-06 05:17:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:17:24,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 05:17:28,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 62 [2025-02-06 05:17:28,300 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 94 treesize of output 90 [2025-02-06 05:17:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 36 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 05:17:28,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597391023] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 05:17:28,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 05:17:28,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 30, 26] total 64 [2025-02-06 05:17:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153901369] [2025-02-06 05:17:28,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 05:17:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-06 05:17:28,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 05:17:28,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-06 05:17:28,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=3691, Unknown=0, NotChecked=0, Total=4032 [2025-02-06 05:17:28,387 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 64 states, 62 states have (on average 1.6290322580645162) internal successors, (101), 60 states have internal predecessors, (101), 7 states have call successors, (11), 5 states have call predecessors, (11), 7 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8)