./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-1.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 6a8b3323a92d99d7113afe189cb74ca3fccfd0743fd857bf4a57e73eb6656833 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:21:27,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:21:27,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:21:27,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:21:27,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:21:27,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:21:27,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:21:27,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:21:27,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:21:27,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:21:27,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:21:27,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:21:27,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:21:27,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:21:27,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:21:27,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:21:27,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:21:27,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:21:27,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:21:27,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:21:27,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:21:27,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:21:27,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:21:27,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:27,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:27,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:21:27,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:21:27,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:21:27,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:21:27,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:21:27,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:21:27,887 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 -> 6a8b3323a92d99d7113afe189cb74ca3fccfd0743fd857bf4a57e73eb6656833 [2025-01-09 17:21:28,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:21:28,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:21:28,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:21:28,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:21:28,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:21:28,169 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-1.i [2025-01-09 17:21:29,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca86d2c5a/9d65d401fc324d3f8374254ee8cec356/FLAG0423af57d [2025-01-09 17:21:30,061 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:21:30,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_node_reset_harness-1.i [2025-01-09 17:21:30,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca86d2c5a/9d65d401fc324d3f8374254ee8cec356/FLAG0423af57d [2025-01-09 17:21:30,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca86d2c5a/9d65d401fc324d3f8374254ee8cec356 [2025-01-09 17:21:30,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:21:30,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:21:30,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:21:30,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:21:30,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:21:30,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:30" (1/1) ... [2025-01-09 17:21:30,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab9cb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:30, skipping insertion in model container [2025-01-09 17:21:30,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:21:30" (1/1) ... [2025-01-09 17:21:30,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:21:30,450 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-1.i[4500,4513] [2025-01-09 17:21:30,456 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-1.i[4560,4573] [2025-01-09 17:21:31,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,181 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,182 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,183 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,203 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,206 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,207 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,208 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,209 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,210 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,211 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,629 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-1.i[150301,150314] [2025-01-09 17:21:31,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:21:31,651 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:21:31,667 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-1.i[4500,4513] [2025-01-09 17:21:31,668 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-1.i[4560,4573] [2025-01-09 17:21:31,719 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,720 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,720 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,725 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,736 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,737 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,738 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,740 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,741 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,742 WARN L1731 CHandler]: Possible shadowing of function index [2025-01-09 17:21:31,844 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-1.i[150301,150314] [2025-01-09 17:21:31,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:21:31,990 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:21:31,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31 WrapperNode [2025-01-09 17:21:31,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:21:31,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:21:31,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:21:31,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:21:31,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,114 INFO L138 Inliner]: procedures = 668, calls = 1032, calls flagged for inlining = 49, calls inlined = 3, statements flattened = 27 [2025-01-09 17:21:32,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:21:32,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:21:32,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:21:32,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:21:32,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,141 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-01-09 17:21:32,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:21:32,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:21:32,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:21:32,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:21:32,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (1/1) ... [2025-01-09 17:21:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:21:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:32,224 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-01-09 17:21:32,228 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-01-09 17:21:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_reset [2025-01-09 17:21:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_reset [2025-01-09 17:21:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2025-01-09 17:21:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2025-01-09 17:21:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:21:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:21:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:21:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:21:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 17:21:32,252 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 17:21:32,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:21:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:21:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:21:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 17:21:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 17:21:32,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 17:21:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 17:21:32,253 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 17:21:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 17:21:32,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:21:32,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:21:32,461 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:21:32,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:21:32,647 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 17:21:32,647 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:21:32,654 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:21:32,654 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 17:21:32,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:32 BoogieIcfgContainer [2025-01-09 17:21:32,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:21:32,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:21:32,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:21:32,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:21:32,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:21:30" (1/3) ... [2025-01-09 17:21:32,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6f1cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:32, skipping insertion in model container [2025-01-09 17:21:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:31" (2/3) ... [2025-01-09 17:21:32,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6f1cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:32, skipping insertion in model container [2025-01-09 17:21:32,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:32" (3/3) ... [2025-01-09 17:21:32,663 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_node_reset_harness-1.i [2025-01-09 17:21:32,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:21:32,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_node_reset_harness-1.i that has 8 procedures, 47 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 17:21:32,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:21:32,736 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;@279fd401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:21:32,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:21:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-01-09 17:21:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 17:21:32,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:32,749 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-01-09 17:21:32,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:32,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 546161837, now seen corresponding path program 1 times [2025-01-09 17:21:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065973091] [2025-01-09 17:21:32,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:32,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 17:21:32,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 17:21:32,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:32,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:33,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:33,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065973091] [2025-01-09 17:21:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065973091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:33,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:21:33,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 17:21:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751849532] [2025-01-09 17:21:33,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:33,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 17:21:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 17:21:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 17:21:33,063 INFO L87 Difference]: Start difference. First operand has 39 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 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-01-09 17:21:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:33,080 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-01-09 17:21:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 17:21:33,082 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-01-09 17:21:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:33,087 INFO L225 Difference]: With dead ends: 71 [2025-01-09 17:21:33,087 INFO L226 Difference]: Without dead ends: 34 [2025-01-09 17:21:33,089 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-01-09 17:21:33,092 INFO L435 NwaCegarLoop]: 43 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, 43 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-01-09 17:21:33,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-09 17:21:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-09 17:21:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-01-09 17:21:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-09 17:21:33,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2025-01-09 17:21:33,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:33,129 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-09 17:21:33,130 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-01-09 17:21:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-09 17:21:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 17:21:33,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:33,131 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] [2025-01-09 17:21:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:21:33,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:33,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 945616150, now seen corresponding path program 1 times [2025-01-09 17:21:33,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:33,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98247694] [2025-01-09 17:21:33,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:33,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:33,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 17:21:33,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 17:21:33,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:33,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98247694] [2025-01-09 17:21:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98247694] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:33,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:21:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:21:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494591910] [2025-01-09 17:21:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:33,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:21:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:33,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:21:33,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:21:33,648 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-01-09 17:21:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:33,706 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-01-09 17:21:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 17:21:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 25 [2025-01-09 17:21:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:33,710 INFO L225 Difference]: With dead ends: 44 [2025-01-09 17:21:33,711 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 17:21:33,711 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-01-09 17:21:33,712 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 171 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-01-09 17:21:33,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 171 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 17:21:33,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-01-09 17:21:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 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-01-09 17:21:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-01-09 17:21:33,725 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2025-01-09 17:21:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:33,726 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-01-09 17:21:33,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-01-09 17:21:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-01-09 17:21:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:21:33,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:33,727 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-01-09 17:21:33,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:21:33,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:33,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 876672721, now seen corresponding path program 1 times [2025-01-09 17:21:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:33,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389165089] [2025-01-09 17:21:33,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:33,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:21:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:21:33,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:33,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:33,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389165089] [2025-01-09 17:21:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389165089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:21:33,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:21:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:21:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906574383] [2025-01-09 17:21:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:21:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:21:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:33,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:21:33,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:21:33,992 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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), 2 states have call successors, (3) [2025-01-09 17:21:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:34,021 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-01-09 17:21:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:21:34,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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), 2 states have call successors, (3) Word has length 26 [2025-01-09 17:21:34,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:34,024 INFO L225 Difference]: With dead ends: 71 [2025-01-09 17:21:34,025 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 17:21:34,025 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-01-09 17:21:34,026 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 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-01-09 17:21:34,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 17:21:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 17:21:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 17:21:34,033 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-01-09 17:21:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-01-09 17:21:34,034 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 26 [2025-01-09 17:21:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:34,034 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-01-09 17:21:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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), 2 states have call successors, (3) [2025-01-09 17:21:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-01-09 17:21:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 17:21:34,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:34,038 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-01-09 17:21:34,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:21:34,038 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:34,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1403897721, now seen corresponding path program 1 times [2025-01-09 17:21:34,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:34,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598114259] [2025-01-09 17:21:34,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:34,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 17:21:34,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 17:21:34,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:34,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:34,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598114259] [2025-01-09 17:21:34,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598114259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:34,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930711813] [2025-01-09 17:21:34,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:34,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:34,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:34,324 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-01-09 17:21:34,326 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-01-09 17:21:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 17:21:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 17:21:34,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:34,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:34,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 17:21:34,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:34,604 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-01-09 17:21:35,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:35,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:35,606 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-01-09 17:21:35,611 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-01-09 17:21:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:35,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930711813] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:35,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:35,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15, 10] total 25 [2025-01-09 17:21:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404862057] [2025-01-09 17:21:35,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:35,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 17:21:35,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:35,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 17:21:35,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2025-01-09 17:21:35,681 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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-01-09 17:21:36,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:36,520 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2025-01-09 17:21:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 17:21:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 27 [2025-01-09 17:21:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:36,524 INFO L225 Difference]: With dead ends: 78 [2025-01-09 17:21:36,524 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 17:21:36,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 17:21:36,526 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:36,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 329 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 17:21:36,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 17:21:36,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-01-09 17:21:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.2) internal successors, (36), 33 states have internal predecessors, (36), 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-01-09 17:21:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-01-09 17:21:36,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 27 [2025-01-09 17:21:36,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:36,541 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-01-09 17:21:36,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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-01-09 17:21:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2025-01-09 17:21:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 17:21:36,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:36,543 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] [2025-01-09 17:21:36,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:36,747 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-01-09 17:21:36,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:36,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2092109845, now seen corresponding path program 1 times [2025-01-09 17:21:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798641791] [2025-01-09 17:21:36,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:36,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 17:21:36,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 17:21:36,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:36,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 17:21:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798641791] [2025-01-09 17:21:37,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798641791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366805109] [2025-01-09 17:21:37,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:21:37,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:37,013 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-01-09 17:21:37,017 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-01-09 17:21:37,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 17:21:37,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 17:21:37,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:21:37,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 17:21:37,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:37,220 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-01-09 17:21:37,248 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-01-09 17:21:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:37,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:38,447 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-01-09 17:21:38,451 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-01-09 17:21:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:38,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366805109] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:38,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 17, 12] total 30 [2025-01-09 17:21:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869803117] [2025-01-09 17:21:38,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 17:21:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:38,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 17:21:38,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2025-01-09 17:21:38,519 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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-01-09 17:21:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:39,550 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2025-01-09 17:21:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 17:21:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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 30 [2025-01-09 17:21:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:39,552 INFO L225 Difference]: With dead ends: 89 [2025-01-09 17:21:39,552 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 17:21:39,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=210, Invalid=2046, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 17:21:39,554 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:39,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 381 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:21:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 17:21:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2025-01-09 17:21:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 36 states have internal predecessors, (41), 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-01-09 17:21:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-01-09 17:21:39,563 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 30 [2025-01-09 17:21:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:39,564 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-01-09 17:21:39,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 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-01-09 17:21:39,564 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-01-09 17:21:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 17:21:39,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:39,565 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] [2025-01-09 17:21:39,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 17:21:39,769 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-01-09 17:21:39,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:39,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:39,769 INFO L85 PathProgramCache]: Analyzing trace with hash 658687489, now seen corresponding path program 2 times [2025-01-09 17:21:39,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:39,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306520435] [2025-01-09 17:21:39,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:21:39,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:39,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 17:21:39,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 17:21:39,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:21:39,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 17:21:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306520435] [2025-01-09 17:21:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306520435] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072386923] [2025-01-09 17:21:40,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:21:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:40,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:40,108 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-01-09 17:21:40,111 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-01-09 17:21:40,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 17:21:40,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 17:21:40,234 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:21:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:40,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 17:21:40,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:40,330 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-01-09 17:21:40,354 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-01-09 17:21:40,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:40,389 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-01-09 17:21:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:40,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:41,901 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 28 treesize of output 26 [2025-01-09 17:21:41,904 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 36 treesize of output 32 [2025-01-09 17:21:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:41,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072386923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:41,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 19, 15] total 36 [2025-01-09 17:21:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343500616] [2025-01-09 17:21:41,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:41,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 17:21:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:41,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 17:21:41,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 17:21:41,955 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 36 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 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) [2025-01-09 17:21:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:43,519 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2025-01-09 17:21:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 17:21:43,520 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 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) Word has length 33 [2025-01-09 17:21:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:43,521 INFO L225 Difference]: With dead ends: 97 [2025-01-09 17:21:43,521 INFO L226 Difference]: Without dead ends: 62 [2025-01-09 17:21:43,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=283, Invalid=3257, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 17:21:43,523 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:43,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 442 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 17:21:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-01-09 17:21:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2025-01-09 17:21:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 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-01-09 17:21:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2025-01-09 17:21:43,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 33 [2025-01-09 17:21:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:43,546 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2025-01-09 17:21:43,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 32 states have internal predecessors, (61), 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) [2025-01-09 17:21:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2025-01-09 17:21:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 17:21:43,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:43,547 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] [2025-01-09 17:21:43,555 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-01-09 17:21:43,751 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-01-09 17:21:43,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:43,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:43,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1027893917, now seen corresponding path program 3 times [2025-01-09 17:21:43,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:43,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308278334] [2025-01-09 17:21:43,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 17:21:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:43,771 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-01-09 17:21:43,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-01-09 17:21:43,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 17:21:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:21:44,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308278334] [2025-01-09 17:21:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308278334] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686884149] [2025-01-09 17:21:44,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 17:21:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:44,064 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-01-09 17:21:44,067 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-01-09 17:21:44,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-01-09 17:21:44,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-01-09 17:21:44,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 17:21:44,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:44,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 17:21:44,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:21:44,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:21:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686884149] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:44,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:44,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-01-09 17:21:44,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248039580] [2025-01-09 17:21:44,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:44,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 17:21:44,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:44,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 17:21:44,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-01-09 17:21:44,445 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 17:21:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:44,643 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2025-01-09 17:21:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 17:21:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2025-01-09 17:21:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:44,646 INFO L225 Difference]: With dead ends: 98 [2025-01-09 17:21:44,646 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 17:21:44,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2025-01-09 17:21:44,648 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:44,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:21:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 17:21:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 17:21:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 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-01-09 17:21:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-01-09 17:21:44,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 36 [2025-01-09 17:21:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:44,673 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-01-09 17:21:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 17:21:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2025-01-09 17:21:44,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 17:21:44,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:44,674 INFO L218 NwaCegarLoop]: trace histogram [10, 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] [2025-01-09 17:21:44,686 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-01-09 17:21:44,874 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-01-09 17:21:44,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1660692893, now seen corresponding path program 4 times [2025-01-09 17:21:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058458024] [2025-01-09 17:21:44,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 17:21:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:44,898 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 17:21:44,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:21:44,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 17:21:44,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 17:21:45,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058458024] [2025-01-09 17:21:45,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058458024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003488895] [2025-01-09 17:21:45,412 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 17:21:45,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:45,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:45,414 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-01-09 17:21:45,417 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-01-09 17:21:45,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-01-09 17:21:45,613 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 17:21:45,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 17:21:45,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:45,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 17:21:45,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:45,714 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-01-09 17:21:45,740 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-01-09 17:21:45,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:45,775 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-01-09 17:21:45,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:45,813 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-01-09 17:21:45,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:45,871 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-01-09 17:21:45,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:45,926 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-01-09 17:21:46,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:46,003 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-01-09 17:21:46,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:46,069 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-01-09 17:21:46,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:46,147 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-01-09 17:21:46,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:46,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-01-09 17:21:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:47,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:21:51,162 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 70 treesize of output 68 [2025-01-09 17:21:51,165 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 123 treesize of output 119 [2025-01-09 17:21:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:51,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003488895] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:21:51,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:21:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27, 22] total 58 [2025-01-09 17:21:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751631742] [2025-01-09 17:21:51,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:21:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-01-09 17:21:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:21:51,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-01-09 17:21:51,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2963, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 17:21:51,310 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 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-01-09 17:21:53,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:21:53,785 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2025-01-09 17:21:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 17:21:53,786 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 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 42 [2025-01-09 17:21:53,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:21:53,787 INFO L225 Difference]: With dead ends: 107 [2025-01-09 17:21:53,787 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 17:21:53,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=640, Invalid=6500, Unknown=0, NotChecked=0, Total=7140 [2025-01-09 17:21:53,790 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 95 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:21:53,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 753 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 17:21:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 17:21:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-01-09 17:21:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 48 states have internal predecessors, (57), 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-01-09 17:21:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2025-01-09 17:21:53,809 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 42 [2025-01-09 17:21:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:21:53,809 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2025-01-09 17:21:53,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 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-01-09 17:21:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2025-01-09 17:21:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 17:21:53,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:21:53,810 INFO L218 NwaCegarLoop]: trace histogram [11, 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] [2025-01-09 17:21:53,821 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-01-09 17:21:54,011 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-01-09 17:21:54,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:21:54,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:21:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash -39001719, now seen corresponding path program 5 times [2025-01-09 17:21:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:21:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153771894] [2025-01-09 17:21:54,012 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 17:21:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:21:54,036 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-01-09 17:21:54,182 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 17:21:54,183 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-01-09 17:21:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 17:21:55,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:21:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153771894] [2025-01-09 17:21:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153771894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:21:55,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730719024] [2025-01-09 17:21:55,633 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 17:21:55,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:21:55,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:21:55,636 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-01-09 17:21:55,638 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-01-09 17:21:55,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 7 equivalence classes. [2025-01-09 17:21:56,868 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 17:21:56,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-01-09 17:21:56,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:21:56,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 17:21:56,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:21:57,208 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-01-09 17:21:57,261 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 29 treesize of output 13 [2025-01-09 17:21:57,303 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-01-09 17:21:57,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:57,364 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 38 treesize of output 25 [2025-01-09 17:21:57,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:57,407 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 32 treesize of output 34 [2025-01-09 17:21:57,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:57,455 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 41 treesize of output 46 [2025-01-09 17:21:57,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:21:57,534 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 50 treesize of output 58 [2025-01-09 17:21:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:21:58,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:00,388 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 52 treesize of output 50 [2025-01-09 17:22:00,393 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 46744 treesize of output 46232 [2025-01-09 17:22:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730719024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:00,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 29, 24] total 63 [2025-01-09 17:22:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027551850] [2025-01-09 17:22:00,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:00,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 17:22:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:00,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 17:22:00,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=3651, Unknown=0, NotChecked=0, Total=3906 [2025-01-09 17:22:00,806 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 63 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 60 states have internal predecessors, (93), 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-01-09 17:22:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:04,391 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2025-01-09 17:22:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 17:22:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 60 states have internal predecessors, (93), 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 45 [2025-01-09 17:22:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:04,396 INFO L225 Difference]: With dead ends: 121 [2025-01-09 17:22:04,396 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 17:22:04,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1938 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=620, Invalid=9082, Unknown=0, NotChecked=0, Total=9702 [2025-01-09 17:22:04,401 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:04,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1026 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 17:22:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 17:22:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2025-01-09 17:22:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 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-01-09 17:22:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-01-09 17:22:04,427 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 45 [2025-01-09 17:22:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:04,428 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-01-09 17:22:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 60 states have internal predecessors, (93), 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-01-09 17:22:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-01-09 17:22:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 17:22:04,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:04,430 INFO L218 NwaCegarLoop]: trace histogram [12, 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] [2025-01-09 17:22:04,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 17:22:04,630 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-01-09 17:22:04,631 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:04,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:04,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1763835867, now seen corresponding path program 6 times [2025-01-09 17:22:04,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:04,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987793372] [2025-01-09 17:22:04,631 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 17:22:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:04,654 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 7 equivalence classes. [2025-01-09 17:22:04,789 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 17:22:04,790 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-09 17:22:04,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 17:22:05,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987793372] [2025-01-09 17:22:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987793372] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443446171] [2025-01-09 17:22:05,229 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 17:22:05,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:05,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:05,231 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-01-09 17:22:05,233 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-01-09 17:22:05,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 48 statements into 7 equivalence classes. [2025-01-09 17:22:08,378 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 17:22:08,378 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-09 17:22:08,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:08,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-01-09 17:22:08,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:08,505 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-01-09 17:22:08,526 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-01-09 17:22:08,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,554 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-01-09 17:22:08,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,590 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-01-09 17:22:08,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,644 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-01-09 17:22:08,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,690 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-01-09 17:22:08,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,749 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-01-09 17:22:08,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,818 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-01-09 17:22:08,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:08,917 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-01-09 17:22:09,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:09,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-01-09 17:22:09,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:09,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-01-09 17:22:09,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:09,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2025-01-09 17:22:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:11,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:17,926 WARN L286 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 184 DAG size of output: 180 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-09 17:22:19,858 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 82 treesize of output 80 [2025-01-09 17:22:19,865 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 141 treesize of output 137 [2025-01-09 17:22:20,019 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:20,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443446171] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:20,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:20,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 32, 28] total 71 [2025-01-09 17:22:20,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630308513] [2025-01-09 17:22:20,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:20,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-01-09 17:22:20,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:20,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-01-09 17:22:20,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=4570, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 17:22:20,022 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 71 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 67 states have internal predecessors, (100), 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) [2025-01-09 17:22:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:24,389 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2025-01-09 17:22:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 17:22:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 67 states have internal predecessors, (100), 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) Word has length 48 [2025-01-09 17:22:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:24,390 INFO L225 Difference]: With dead ends: 122 [2025-01-09 17:22:24,390 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 17:22:24,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=798, Invalid=10332, Unknown=0, NotChecked=0, Total=11130 [2025-01-09 17:22:24,393 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 140 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:24,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1049 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 17:22:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 17:22:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2025-01-09 17:22:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 54 states have internal predecessors, (67), 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-01-09 17:22:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-01-09 17:22:24,412 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 48 [2025-01-09 17:22:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:24,412 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-01-09 17:22:24,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 67 states have internal predecessors, (100), 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) [2025-01-09 17:22:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-01-09 17:22:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 17:22:24,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:24,414 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-01-09 17:22:24,424 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-01-09 17:22:24,614 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-01-09 17:22:24,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:24,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1450809361, now seen corresponding path program 7 times [2025-01-09 17:22:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:24,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333748516] [2025-01-09 17:22:24,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 17:22:24,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:24,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 17:22:24,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 17:22:24,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:24,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 17:22:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333748516] [2025-01-09 17:22:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333748516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815709207] [2025-01-09 17:22:25,244 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 17:22:25,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:25,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:25,246 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-01-09 17:22:25,248 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-01-09 17:22:25,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 17:22:25,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 17:22:25,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:22:25,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:25,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-01-09 17:22:25,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:25,916 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-01-09 17:22:25,947 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 27 treesize of output 11 [2025-01-09 17:22:25,982 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-01-09 17:22:26,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,027 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-01-09 17:22:26,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,065 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-01-09 17:22:26,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,107 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-01-09 17:22:26,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,155 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-01-09 17:22:26,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,231 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-01-09 17:22:26,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,297 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-01-09 17:22:26,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,374 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-01-09 17:22:26,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-01-09 17:22:26,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-01-09 17:22:26,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:26,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 111 treesize of output 140 [2025-01-09 17:22:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:28,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 17:22:36,485 WARN L286 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 189 DAG size of output: 186 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-01-09 17:22:38,248 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 88 treesize of output 86 [2025-01-09 17:22:38,258 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 12700843 treesize of output 12438699 [2025-01-09 17:22:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 56 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815709207] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 17:22:38,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 17:22:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 33, 28] total 73 [2025-01-09 17:22:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723550332] [2025-01-09 17:22:38,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 17:22:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-01-09 17:22:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:22:38,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-01-09 17:22:38,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=4749, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 17:22:38,472 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 73 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 70 states have internal predecessors, (107), 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-01-09 17:22:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:22:42,607 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2025-01-09 17:22:42,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-01-09 17:22:42,608 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 70 states have internal predecessors, (107), 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 51 [2025-01-09 17:22:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:22:42,609 INFO L225 Difference]: With dead ends: 129 [2025-01-09 17:22:42,609 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 17:22:42,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=931, Invalid=10411, Unknown=0, NotChecked=0, Total=11342 [2025-01-09 17:22:42,611 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 127 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 17:22:42,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 861 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 17:22:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 17:22:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-01-09 17:22:42,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 57 states have internal predecessors, (72), 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-01-09 17:22:42,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2025-01-09 17:22:42,641 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 51 [2025-01-09 17:22:42,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:22:42,641 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2025-01-09 17:22:42,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 70 states have internal predecessors, (107), 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-01-09 17:22:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2025-01-09 17:22:42,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 17:22:42,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:22:42,642 INFO L218 NwaCegarLoop]: trace histogram [14, 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] [2025-01-09 17:22:42,651 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-01-09 17:22:42,842 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-01-09 17:22:42,843 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:22:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:22:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2145545555, now seen corresponding path program 8 times [2025-01-09 17:22:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:22:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149236629] [2025-01-09 17:22:42,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:22:42,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-01-09 17:22:42,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 17:22:42,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:42,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-01-09 17:22:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:22:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149236629] [2025-01-09 17:22:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149236629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 17:22:43,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074667002] [2025-01-09 17:22:43,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 17:22:43,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 17:22:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:22:43,475 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-01-09 17:22:43,477 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-01-09 17:22:43,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-01-09 17:22:44,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 17:22:44,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 17:22:44,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:22:44,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 146 conjuncts are in the unsatisfiable core [2025-01-09 17:22:44,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 17:22:44,376 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-01-09 17:22:44,414 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-01-09 17:22:44,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,463 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-01-09 17:22:44,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,507 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-01-09 17:22:44,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,561 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-01-09 17:22:44,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,610 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-01-09 17:22:44,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,666 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-01-09 17:22:44,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,726 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-01-09 17:22:44,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,795 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 90 treesize of output 95 [2025-01-09 17:22:44,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,865 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 90 treesize of output 95 [2025-01-09 17:22:44,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:44,943 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 90 treesize of output 95 [2025-01-09 17:22:45,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:45,058 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-01-09 17:22:45,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:45,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 93 treesize of output 116 [2025-01-09 17:22:45,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 17:22:45,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 102 treesize of output 128 [2025-01-09 17:22:47,281 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:22:47,282 INFO L312 TraceCheckSpWp]: Computing backward predicates...