./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/recursified_loop-simple/recursified_nested_5.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:13,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:13,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:10:13,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:13,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:13,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:13,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:13,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:13,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:13,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:13,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:13,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:13,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:13,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:13,421 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:13,421 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:13,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:13,422 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:13,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:13,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:13,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:13,425 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2025-01-09 04:10:13,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:13,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:13,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:13,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:13,677 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:13,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-01-09 04:10:14,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a270ab6f/7ec80ca93579490ea92be451eb6a4d8e/FLAGcdd5c5968 [2025-01-09 04:10:15,030 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:15,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2025-01-09 04:10:15,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a270ab6f/7ec80ca93579490ea92be451eb6a4d8e/FLAGcdd5c5968 [2025-01-09 04:10:15,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a270ab6f/7ec80ca93579490ea92be451eb6a4d8e [2025-01-09 04:10:15,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:15,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:15,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:15,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:15,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:15,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0a220d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:15,531 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/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2025-01-09 04:10:15,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:15,543 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:15,562 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/recursified_loop-simple/recursified_nested_5.c[2721,2734] [2025-01-09 04:10:15,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:15,576 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:15,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15 WrapperNode [2025-01-09 04:10:15,577 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:15,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:15,578 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:15,578 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:15,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,605 INFO L138 Inliner]: procedures = 16, calls = 62, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2025-01-09 04:10:15,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:15,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:15,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:15,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:15,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,636 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2025-01-09 04:10:15,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:15,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:15,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:15,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:15,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:15,684 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 04:10:15,687 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 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:10:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-01-09 04:10:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-01-09 04:10:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-01-09 04:10:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2025-01-09 04:10:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-01-09 04:10:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-01-09 04:10:15,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:15,769 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:15,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:15,938 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:15,938 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:15,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:15,948 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:15,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:15 BoogieIcfgContainer [2025-01-09 04:10:15,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:15,950 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:15,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:15,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:15,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:15" (1/3) ... [2025-01-09 04:10:15,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60884950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (2/3) ... [2025-01-09 04:10:15,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60884950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:15" (3/3) ... [2025-01-09 04:10:15,954 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2025-01-09 04:10:15,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:15,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_5.c that has 6 procedures, 51 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:10:16,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:16,014 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;@397144c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:16,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 04:10:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 04:10:16,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1772465061, now seen corresponding path program 1 times [2025-01-09 04:10:16,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958775478] [2025-01-09 04:10:16,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 04:10:16,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 04:10:16,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,476 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 04:10:16,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958775478] [2025-01-09 04:10:16,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958775478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:16,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724897921] [2025-01-09 04:10:16,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:16,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:16,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:16,499 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,699 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2025-01-09 04:10:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:16,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 04:10:16,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,707 INFO L225 Difference]: With dead ends: 68 [2025-01-09 04:10:16,707 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 04:10:16,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:16,714 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 83 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 04:10:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 04:10:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.28125) internal successors, (41), 37 states have internal predecessors, (41), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2025-01-09 04:10:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2025-01-09 04:10:16,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 17 [2025-01-09 04:10:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,749 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2025-01-09 04:10:16,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2025-01-09 04:10:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 04:10:16,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,752 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] [2025-01-09 04:10:16,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:16,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1896614561, now seen corresponding path program 1 times [2025-01-09 04:10:16,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100132449] [2025-01-09 04:10:16,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 04:10:16,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 04:10:16,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:10:16,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:16,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100132449] [2025-01-09 04:10:16,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100132449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:16,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:16,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:16,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758495855] [2025-01-09 04:10:16,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:16,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:16,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:16,984 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:17,143 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2025-01-09 04:10:17,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-01-09 04:10:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:17,145 INFO L225 Difference]: With dead ends: 97 [2025-01-09 04:10:17,145 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 04:10:17,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:17,147 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:17,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 94 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 04:10:17,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 04:10:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 38 states have internal predecessors, (42), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-01-09 04:10:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2025-01-09 04:10:17,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 28 [2025-01-09 04:10:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:17,157 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2025-01-09 04:10:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2025-01-09 04:10:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:10:17,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:17,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:17,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:10:17,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:17,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:17,162 INFO L85 PathProgramCache]: Analyzing trace with hash 659087250, now seen corresponding path program 1 times [2025-01-09 04:10:17,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:17,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130306783] [2025-01-09 04:10:17,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:17,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:10:17,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:10:17,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:17,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:10:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130306783] [2025-01-09 04:10:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130306783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625465458] [2025-01-09 04:10:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:17,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:17,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:17,377 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:10:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:17,506 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2025-01-09 04:10:17,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:17,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-01-09 04:10:17,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:17,508 INFO L225 Difference]: With dead ends: 101 [2025-01-09 04:10:17,508 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 04:10:17,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:17,509 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 21 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:17,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 140 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 04:10:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 04:10:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2025-01-09 04:10:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2025-01-09 04:10:17,514 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 39 [2025-01-09 04:10:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:17,514 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2025-01-09 04:10:17,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 04:10:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2025-01-09 04:10:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:10:17,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:17,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:17,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:10:17,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:17,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -263259713, now seen corresponding path program 1 times [2025-01-09 04:10:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492555635] [2025-01-09 04:10:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:10:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:10:17,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:10:17,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:17,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492555635] [2025-01-09 04:10:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492555635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:17,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:17,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582358437] [2025-01-09 04:10:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:17,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:17,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:17,690 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:10:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:17,801 INFO L93 Difference]: Finished difference Result 105 states and 137 transitions. [2025-01-09 04:10:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:17,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 50 [2025-01-09 04:10:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:17,802 INFO L225 Difference]: With dead ends: 105 [2025-01-09 04:10:17,802 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 04:10:17,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:17,803 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:17,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 168 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 04:10:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 04:10:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:10:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-01-09 04:10:17,809 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 50 [2025-01-09 04:10:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:17,809 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-01-09 04:10:17,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:10:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-01-09 04:10:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:10:17,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:17,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:17,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:10:17,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:17,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -889035351, now seen corresponding path program 1 times [2025-01-09 04:10:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082080611] [2025-01-09 04:10:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:17,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:10:17,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:10:17,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:17,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:10:18,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:18,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082080611] [2025-01-09 04:10:18,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082080611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:18,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:18,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820266349] [2025-01-09 04:10:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:18,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:18,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:18,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:18,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:18,010 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:10:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:18,096 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2025-01-09 04:10:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) Word has length 61 [2025-01-09 04:10:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:18,097 INFO L225 Difference]: With dead ends: 109 [2025-01-09 04:10:18,098 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 04:10:18,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:18,100 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:18,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 174 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 04:10:18,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 04:10:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 41 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2025-01-09 04:10:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2025-01-09 04:10:18,109 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 61 [2025-01-09 04:10:18,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:18,112 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2025-01-09 04:10:18,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 1 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:10:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2025-01-09 04:10:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:10:18,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:18,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:18,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:10:18,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:18,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -873526421, now seen corresponding path program 1 times [2025-01-09 04:10:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765041098] [2025-01-09 04:10:18,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:18,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:10:18,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:10:18,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:18,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:10:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:18,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765041098] [2025-01-09 04:10:18,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765041098] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388139863] [2025-01-09 04:10:18,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:18,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:18,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:18,541 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 04:10:18,543 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 04:10:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:10:18,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:10:18,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:18,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:18,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 04:10:18,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:18,761 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 15 treesize of output 1 [2025-01-09 04:10:18,885 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 25 treesize of output 13 [2025-01-09 04:10:18,951 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 15 treesize of output 7 [2025-01-09 04:10:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:10:18,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:22,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388139863] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:22,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:22,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2025-01-09 04:10:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653795250] [2025-01-09 04:10:22,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:10:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:22,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:10:22,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:10:22,814 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 8 states have call successors, (18), 3 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2025-01-09 04:10:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:23,405 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2025-01-09 04:10:23,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 04:10:23,406 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 8 states have call successors, (18), 3 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) Word has length 66 [2025-01-09 04:10:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:23,407 INFO L225 Difference]: With dead ends: 137 [2025-01-09 04:10:23,407 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 04:10:23,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:10:23,408 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 62 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:23,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 368 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:10:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 04:10:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2025-01-09 04:10:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 51 states have internal predecessors, (58), 11 states have call successors, (11), 6 states have call predecessors, (11), 14 states have return successors, (23), 15 states have call predecessors, (23), 11 states have call successors, (23) [2025-01-09 04:10:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2025-01-09 04:10:23,417 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 66 [2025-01-09 04:10:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2025-01-09 04:10:23,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 8 states have call successors, (18), 3 states have call predecessors, (18), 7 states have return successors, (20), 7 states have call predecessors, (20), 8 states have call successors, (20) [2025-01-09 04:10:23,417 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2025-01-09 04:10:23,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:10:23,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:23,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:23,429 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 04:10:23,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:23,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:23,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1236132483, now seen corresponding path program 1 times [2025-01-09 04:10:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199501375] [2025-01-09 04:10:23,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:23,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:10:23,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:10:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:10:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:23,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199501375] [2025-01-09 04:10:23,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199501375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:23,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:23,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:10:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591322119] [2025-01-09 04:10:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:23,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:10:23,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:23,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:10:23,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:23,703 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:10:23,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:23,723 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2025-01-09 04:10:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:10:23,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-01-09 04:10:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:23,726 INFO L225 Difference]: With dead ends: 81 [2025-01-09 04:10:23,726 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 04:10:23,726 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 04:10:23,727 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:23,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 04:10:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2025-01-09 04:10:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 53 states have internal predecessors, (60), 11 states have call successors, (11), 6 states have call predecessors, (11), 14 states have return successors, (23), 15 states have call predecessors, (23), 11 states have call successors, (23) [2025-01-09 04:10:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2025-01-09 04:10:23,735 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 71 [2025-01-09 04:10:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2025-01-09 04:10:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:10:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2025-01-09 04:10:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:10:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:23,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:10:23,737 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1237979525, now seen corresponding path program 1 times [2025-01-09 04:10:23,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:23,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629026703] [2025-01-09 04:10:23,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:23,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:23,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:10:23,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:10:23,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:23,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 04:10:23,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:23,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629026703] [2025-01-09 04:10:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629026703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:23,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:10:23,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595583] [2025-01-09 04:10:23,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:10:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:23,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:10:23,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:10:23,805 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:10:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:23,821 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2025-01-09 04:10:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:10:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2025-01-09 04:10:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:23,823 INFO L225 Difference]: With dead ends: 81 [2025-01-09 04:10:23,823 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 04:10:23,823 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 04:10:23,823 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:23,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 04:10:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-01-09 04:10:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 55 states have internal predecessors, (62), 11 states have call successors, (11), 6 states have call predecessors, (11), 14 states have return successors, (23), 15 states have call predecessors, (23), 11 states have call successors, (23) [2025-01-09 04:10:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2025-01-09 04:10:23,836 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 71 [2025-01-09 04:10:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:23,837 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2025-01-09 04:10:23,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-01-09 04:10:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2025-01-09 04:10:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:10:23,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:23,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:10:23,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:23,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1237981447, now seen corresponding path program 1 times [2025-01-09 04:10:23,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:23,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095971518] [2025-01-09 04:10:23,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:23,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:23,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:10:23,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:10:23,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:23,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 04:10:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:24,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095971518] [2025-01-09 04:10:24,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095971518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:24,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38189665] [2025-01-09 04:10:24,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:24,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:24,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:24,296 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 04:10:24,298 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 04:10:24,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:10:24,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:10:24,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:24,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 04:10:24,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:24,431 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 15 treesize of output 1 [2025-01-09 04:10:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:10:24,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:10:25,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38189665] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:25,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:25,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 29 [2025-01-09 04:10:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010470584] [2025-01-09 04:10:25,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:25,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:10:25,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:25,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:10:25,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:25,892 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand has 29 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 25 states have internal predecessors, (69), 10 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-01-09 04:10:26,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:26,109 INFO L93 Difference]: Finished difference Result 155 states and 207 transitions. [2025-01-09 04:10:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:10:26,109 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 25 states have internal predecessors, (69), 10 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) Word has length 71 [2025-01-09 04:10:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:26,111 INFO L225 Difference]: With dead ends: 155 [2025-01-09 04:10:26,111 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 04:10:26,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:10:26,113 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:26,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 361 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 04:10:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 04:10:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 11 states have call successors, (11), 6 states have call predecessors, (11), 16 states have return successors, (25), 17 states have call predecessors, (25), 11 states have call successors, (25) [2025-01-09 04:10:26,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2025-01-09 04:10:26,123 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 71 [2025-01-09 04:10:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:26,124 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2025-01-09 04:10:26,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 25 states have internal predecessors, (69), 10 states have call successors, (20), 6 states have call predecessors, (20), 9 states have return successors, (21), 6 states have call predecessors, (21), 10 states have call successors, (21) [2025-01-09 04:10:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2025-01-09 04:10:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:10:26,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:26,125 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:26,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:10:26,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:26,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:26,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 411558751, now seen corresponding path program 2 times [2025-01-09 04:10:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906613069] [2025-01-09 04:10:26,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:26,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-09 04:10:26,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:10:26,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:26,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 04:10:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906613069] [2025-01-09 04:10:26,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906613069] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:26,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975156725] [2025-01-09 04:10:26,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:26,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:26,913 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 04:10:26,915 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 04:10:26,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-09 04:10:27,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:10:27,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:27,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:27,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 04:10:27,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:27,040 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 04:10:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 04:10:27,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-01-09 04:10:27,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975156725] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:27,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:27,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2025-01-09 04:10:27,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243184802] [2025-01-09 04:10:27,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:27,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:10:27,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:27,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:10:27,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:27,598 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 29 states, 22 states have (on average 3.227272727272727) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 5 states have call predecessors, (22), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-01-09 04:10:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:28,268 INFO L93 Difference]: Finished difference Result 165 states and 220 transitions. [2025-01-09 04:10:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:10:28,269 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 3.227272727272727) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 5 states have call predecessors, (22), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 81 [2025-01-09 04:10:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:28,269 INFO L225 Difference]: With dead ends: 165 [2025-01-09 04:10:28,270 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 04:10:28,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:10:28,271 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 113 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:28,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 231 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:10:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 04:10:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 04:10:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 19 states have return successors, (30), 20 states have call predecessors, (30), 11 states have call successors, (30) [2025-01-09 04:10:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2025-01-09 04:10:28,285 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 81 [2025-01-09 04:10:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:28,285 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2025-01-09 04:10:28,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 3.227272727272727) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (22), 5 states have call predecessors, (22), 11 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-01-09 04:10:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2025-01-09 04:10:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 04:10:28,286 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:28,286 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:28,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:28,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:28,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:28,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 588021159, now seen corresponding path program 3 times [2025-01-09 04:10:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561603951] [2025-01-09 04:10:28,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:28,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 11 equivalence classes. [2025-01-09 04:10:28,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 155 statements. [2025-01-09 04:10:28,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:10:28,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-01-09 04:10:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561603951] [2025-01-09 04:10:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561603951] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309085160] [2025-01-09 04:10:28,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:28,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:28,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:28,833 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 04:10:28,834 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 04:10:28,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 155 statements into 11 equivalence classes. [2025-01-09 04:10:28,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 50 of 155 statements. [2025-01-09 04:10:28,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:10:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:28,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:28,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:28,970 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 15 treesize of output 1 [2025-01-09 04:10:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 04:10:29,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-01-09 04:10:29,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309085160] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:29,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-01-09 04:10:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549290795] [2025-01-09 04:10:29,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:29,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:10:29,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:29,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:10:29,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:10:29,732 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand has 28 states, 21 states have (on average 3.238095238095238) internal successors, (68), 24 states have internal predecessors, (68), 13 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2025-01-09 04:10:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:30,142 INFO L93 Difference]: Finished difference Result 161 states and 200 transitions. [2025-01-09 04:10:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:10:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 3.238095238095238) internal successors, (68), 24 states have internal predecessors, (68), 13 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) Word has length 155 [2025-01-09 04:10:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:30,146 INFO L225 Difference]: With dead ends: 161 [2025-01-09 04:10:30,146 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 04:10:30,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:10:30,147 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:30,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 284 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:10:30,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 04:10:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 04:10:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 10 states have call successors, (10), 5 states have call predecessors, (10), 17 states have return successors, (22), 17 states have call predecessors, (22), 10 states have call successors, (22) [2025-01-09 04:10:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 90 transitions. [2025-01-09 04:10:30,155 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 90 transitions. Word has length 155 [2025-01-09 04:10:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:30,155 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 90 transitions. [2025-01-09 04:10:30,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 3.238095238095238) internal successors, (68), 24 states have internal predecessors, (68), 13 states have call successors, (23), 6 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2025-01-09 04:10:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2025-01-09 04:10:30,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-01-09 04:10:30,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:30,160 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 30, 30, 30, 12, 12, 12, 12, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:30,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:10:30,360 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,SelfDestructingSolverStorable10 [2025-01-09 04:10:30,360 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1253092909, now seen corresponding path program 2 times [2025-01-09 04:10:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:30,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782577000] [2025-01-09 04:10:30,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:30,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:30,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-01-09 04:10:30,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-01-09 04:10:30,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:30,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 78 proven. 95 refuted. 0 times theorem prover too weak. 3622 trivial. 0 not checked. [2025-01-09 04:10:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782577000] [2025-01-09 04:10:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782577000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:31,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294080888] [2025-01-09 04:10:31,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:31,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:31,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:31,156 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 04:10:31,157 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 04:10:31,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 398 statements into 2 equivalence classes. [2025-01-09 04:10:31,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 398 of 398 statements. [2025-01-09 04:10:31,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:31,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:31,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 2284 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:31,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:31,530 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 15 treesize of output 1 [2025-01-09 04:10:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 2018 proven. 3 refuted. 0 times theorem prover too weak. 1774 trivial. 0 not checked. [2025-01-09 04:10:31,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:32,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 64 proven. 78 refuted. 0 times theorem prover too weak. 3653 trivial. 0 not checked. [2025-01-09 04:10:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294080888] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:32,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-01-09 04:10:32,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623764278] [2025-01-09 04:10:32,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:32,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 04:10:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:32,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 04:10:32,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:10:32,916 INFO L87 Difference]: Start difference. First operand 77 states and 90 transitions. Second operand has 24 states, 18 states have (on average 4.666666666666667) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (31), 6 states have call predecessors, (31), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 04:10:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:33,233 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2025-01-09 04:10:33,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:10:33,234 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 4.666666666666667) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (31), 6 states have call predecessors, (31), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) Word has length 398 [2025-01-09 04:10:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:33,235 INFO L225 Difference]: With dead ends: 155 [2025-01-09 04:10:33,235 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 04:10:33,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 782 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:10:33,236 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 60 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:33,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 383 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 04:10:33,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 04:10:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 19 states have return successors, (24), 19 states have call predecessors, (24), 10 states have call successors, (24) [2025-01-09 04:10:33,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2025-01-09 04:10:33,248 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 398 [2025-01-09 04:10:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:33,248 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2025-01-09 04:10:33,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 4.666666666666667) internal successors, (84), 20 states have internal predecessors, (84), 11 states have call successors, (31), 6 states have call predecessors, (31), 8 states have return successors, (34), 8 states have call predecessors, (34), 11 states have call successors, (34) [2025-01-09 04:10:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2025-01-09 04:10:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1113 [2025-01-09 04:10:33,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:33,268 INFO L218 NwaCegarLoop]: trace histogram [144, 144, 120, 120, 120, 36, 36, 24, 24, 24, 24, 24, 24, 24, 18, 18, 12, 12, 12, 12, 12, 12, 12, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:33,277 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 04:10:33,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 04:10:33,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:33,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:33,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1586853679, now seen corresponding path program 3 times [2025-01-09 04:10:33,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:33,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961088515] [2025-01-09 04:10:33,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:33,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1112 statements into 15 equivalence classes. [2025-01-09 04:10:33,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 94 of 1112 statements. [2025-01-09 04:10:33,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:33,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 52704 backedges. 112 proven. 8 refuted. 0 times theorem prover too weak. 52584 trivial. 0 not checked. [2025-01-09 04:10:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961088515] [2025-01-09 04:10:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961088515] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660522772] [2025-01-09 04:10:34,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:34,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:34,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:34,018 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 04:10:34,021 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 04:10:34,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1112 statements into 15 equivalence classes. [2025-01-09 04:10:34,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 94 of 1112 statements. [2025-01-09 04:10:34,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:34,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 04:10:34,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:34,469 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 15 treesize of output 1 [2025-01-09 04:10:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 52704 backedges. 108 proven. 8 refuted. 0 times theorem prover too weak. 52588 trivial. 0 not checked. [2025-01-09 04:10:34,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 52704 backedges. 108 proven. 15 refuted. 0 times theorem prover too weak. 52581 trivial. 0 not checked. [2025-01-09 04:10:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660522772] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:38,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:38,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 30 [2025-01-09 04:10:38,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950807466] [2025-01-09 04:10:38,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:38,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:10:38,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:38,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:10:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:10:38,512 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 30 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (27), 6 states have call predecessors, (27), 9 states have return successors, (28), 12 states have call predecessors, (28), 16 states have call successors, (28) [2025-01-09 04:10:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:38,825 INFO L93 Difference]: Finished difference Result 170 states and 200 transitions. [2025-01-09 04:10:38,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:10:38,826 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (27), 6 states have call predecessors, (27), 9 states have return successors, (28), 12 states have call predecessors, (28), 16 states have call successors, (28) Word has length 1112 [2025-01-09 04:10:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:38,827 INFO L225 Difference]: With dead ends: 170 [2025-01-09 04:10:38,828 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 04:10:38,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2243 GetRequests, 2207 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=1098, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:10:38,829 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 92 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:38,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 420 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 04:10:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-01-09 04:10:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 53 states have (on average 1.169811320754717) internal successors, (62), 58 states have internal predecessors, (62), 10 states have call successors, (10), 5 states have call predecessors, (10), 21 states have return successors, (26), 21 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-09 04:10:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2025-01-09 04:10:38,836 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 1112 [2025-01-09 04:10:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:38,837 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2025-01-09 04:10:38,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 26 states have internal predecessors, (73), 16 states have call successors, (27), 6 states have call predecessors, (27), 9 states have return successors, (28), 12 states have call predecessors, (28), 16 states have call successors, (28) [2025-01-09 04:10:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2025-01-09 04:10:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2175 [2025-01-09 04:10:38,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:38,854 INFO L218 NwaCegarLoop]: trace histogram [288, 288, 240, 240, 240, 72, 72, 48, 48, 48, 48, 48, 48, 48, 36, 36, 24, 24, 24, 24, 24, 24, 24, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:38,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:10:39,055 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,SelfDestructingSolverStorable12 [2025-01-09 04:10:39,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1435462269, now seen corresponding path program 4 times [2025-01-09 04:10:39,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:39,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45446707] [2025-01-09 04:10:39,056 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:39,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2174 statements into 2 equivalence classes. [2025-01-09 04:10:39,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 2173 of 2174 statements. [2025-01-09 04:10:39,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:10:39,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:47,144 INFO L134 CoverageAnalysis]: Checked inductivity of 211599 backedges. 73 proven. 1308 refuted. 0 times theorem prover too weak. 210218 trivial. 0 not checked. [2025-01-09 04:10:47,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:47,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45446707] [2025-01-09 04:10:47,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45446707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:47,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099621392] [2025-01-09 04:10:47,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:47,150 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 04:10:47,152 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 04:10:47,666 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2174 statements into 2 equivalence classes. [2025-01-09 04:10:48,467 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 2173 of 2174 statements. [2025-01-09 04:10:48,468 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:10:48,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:48,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 10023 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 04:10:48,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:48,557 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 15 treesize of output 1 [2025-01-09 04:10:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 211599 backedges. 60118 proven. 35 refuted. 0 times theorem prover too weak. 151446 trivial. 0 not checked. [2025-01-09 04:10:48,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 211599 backedges. 7210 proven. 1306 refuted. 0 times theorem prover too weak. 203083 trivial. 0 not checked. [2025-01-09 04:10:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099621392] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:59,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 26] total 46 [2025-01-09 04:10:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770108961] [2025-01-09 04:10:59,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:59,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 04:10:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:59,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 04:10:59,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1748, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 04:10:59,508 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 46 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 38 states have internal predecessors, (100), 14 states have call successors, (35), 10 states have call predecessors, (35), 17 states have return successors, (45), 16 states have call predecessors, (45), 14 states have call successors, (45) [2025-01-09 04:11:00,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:00,051 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2025-01-09 04:11:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:11:00,051 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 38 states have internal predecessors, (100), 14 states have call successors, (35), 10 states have call predecessors, (35), 17 states have return successors, (45), 16 states have call predecessors, (45), 14 states have call successors, (45) Word has length 2174 [2025-01-09 04:11:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:00,052 INFO L225 Difference]: With dead ends: 171 [2025-01-09 04:11:00,052 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 04:11:00,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4375 GetRequests, 4315 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=582, Invalid=3078, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 04:11:00,053 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 78 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:00,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 827 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:11:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 04:11:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 04:11:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 60 states have internal predecessors, (64), 10 states have call successors, (10), 5 states have call predecessors, (10), 23 states have return successors, (28), 23 states have call predecessors, (28), 10 states have call successors, (28) [2025-01-09 04:11:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2025-01-09 04:11:00,061 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 2174 [2025-01-09 04:11:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:00,061 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2025-01-09 04:11:00,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 38 states have internal predecessors, (100), 14 states have call successors, (35), 10 states have call predecessors, (35), 17 states have return successors, (45), 16 states have call predecessors, (45), 14 states have call successors, (45) [2025-01-09 04:11:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2025-01-09 04:11:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3399 [2025-01-09 04:11:00,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:00,101 INFO L218 NwaCegarLoop]: trace histogram [504, 504, 432, 432, 432, 96, 96, 72, 72, 72, 72, 72, 72, 72, 36, 36, 24, 24, 24, 24, 24, 24, 24, 15, 15, 12, 12, 12, 12, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:00,123 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 04:11:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:00,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1915003133, now seen corresponding path program 5 times [2025-01-09 04:11:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919260375] [2025-01-09 04:11:00,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:11:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:00,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3398 statements into 52 equivalence classes. [2025-01-09 04:11:02,682 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) and asserted 2332 of 3398 statements. [2025-01-09 04:11:02,683 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2025-01-09 04:11:02,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 630027 backedges. 120 proven. 2261 refuted. 0 times theorem prover too weak. 627646 trivial. 0 not checked. [2025-01-09 04:11:17,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:17,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919260375] [2025-01-09 04:11:17,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919260375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:17,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642209172] [2025-01-09 04:11:17,570 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 04:11:17,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:17,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:17,572 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 04:11:17,573 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 04:11:18,308 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 3398 statements into 52 equivalence classes.