./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.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_4.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 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:08,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:08,713 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:08,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:08,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:08,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:08,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:08,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:08,752 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:08,752 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:08,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:08,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:08,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:08,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:08,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:08,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:08,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:08,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:08,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:08,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:08,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:08,757 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 -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-01-09 04:10:09,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:09,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:09,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:09,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:09,065 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:09,067 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_4.c [2025-01-09 04:10:10,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ea4a1dda/918a11eb0aa5490b805548c6ff330a13/FLAG7d577e88b [2025-01-09 04:10:10,546 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:10,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-01-09 04:10:10,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ea4a1dda/918a11eb0aa5490b805548c6ff330a13/FLAG7d577e88b [2025-01-09 04:10:10,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4ea4a1dda/918a11eb0aa5490b805548c6ff330a13 [2025-01-09 04:10:10,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:10,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:10,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:10,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:10,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:10,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:10" (1/1) ... [2025-01-09 04:10:10,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c0362b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:10, skipping insertion in model container [2025-01-09 04:10:10,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:10" (1/1) ... [2025-01-09 04:10:10,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:10,693 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_4.c[2333,2346] [2025-01-09 04:10:10,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:10,703 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:10,717 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_4.c[2333,2346] [2025-01-09 04:10:10,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:10,730 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:10,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:10 WrapperNode [2025-01-09 04:10:10,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:10,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:10,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:10,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:10,739 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:10" (1/1) ... [2025-01-09 04:10:10,745 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:10" (1/1) ... [2025-01-09 04:10:10,761 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-01-09 04:10:10,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:10,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:10,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:10,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:10,770 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:10" (1/1) ... [2025-01-09 04:10:10,770 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:10" (1/1) ... [2025-01-09 04:10:10,771 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:10" (1/1) ... [2025-01-09 04:10:10,784 INFO L175 MemorySlicer]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6]. 23 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 1, 1, 1, 1]. The 8 writes are split as follows [0, 2, 2, 2, 2]. [2025-01-09 04:10:10,784 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:10" (1/1) ... [2025-01-09 04:10:10,784 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:10" (1/1) ... [2025-01-09 04:10:10,793 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:10" (1/1) ... [2025-01-09 04:10:10,794 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:10" (1/1) ... [2025-01-09 04:10:10,796 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:10" (1/1) ... [2025-01-09 04:10:10,797 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:10" (1/1) ... [2025-01-09 04:10:10,798 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:10" (1/1) ... [2025-01-09 04:10:10,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:10,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:10,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:10,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:10,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:10" (1/1) ... [2025-01-09 04:10:10,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:10,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:10,833 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:10,835 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:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:10,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:10,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:10:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:10:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:10:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-01-09 04:10:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-01-09 04:10:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-01-09 04:10:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-01-09 04:10:10,859 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-01-09 04:10:10,859 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-01-09 04:10:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:10,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:10:10,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:10:10,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:10,950 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:10,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:11,184 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:11,184 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:11,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:11,194 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:11,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:11 BoogieIcfgContainer [2025-01-09 04:10:11,194 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:11,196 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:11,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:11,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:11,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:10" (1/3) ... [2025-01-09 04:10:11,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd80ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:11, skipping insertion in model container [2025-01-09 04:10:11,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:10" (2/3) ... [2025-01-09 04:10:11,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd80ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:11, skipping insertion in model container [2025-01-09 04:10:11,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:11" (3/3) ... [2025-01-09 04:10:11,204 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-01-09 04:10:11,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:11,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 42 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:10:11,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:11,287 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;@6546fe4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:11,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:11,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 04:10:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 04:10:11,299 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:11,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:11,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:11,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:11,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1439893324, now seen corresponding path program 1 times [2025-01-09 04:10:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227402078] [2025-01-09 04:10:11,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:11,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:10:11,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:10:11,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:11,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:11,875 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:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227402078] [2025-01-09 04:10:11,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227402078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:11,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:11,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399543709] [2025-01-09 04:10:11,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:11,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:11,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:11,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:11,896 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:12,121 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-01-09 04:10:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2025-01-09 04:10:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:12,129 INFO L225 Difference]: With dead ends: 57 [2025-01-09 04:10:12,130 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 04:10:12,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:12,135 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:12,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 04:10:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 04:10:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-01-09 04:10:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-01-09 04:10:12,169 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 15 [2025-01-09 04:10:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:12,170 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-01-09 04:10:12,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-01-09 04:10:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 04:10:12,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:12,172 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] [2025-01-09 04:10:12,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:12,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2118287023, now seen corresponding path program 1 times [2025-01-09 04:10:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362580585] [2025-01-09 04:10:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:12,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 04:10:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 04:10:12,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:12,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:12,482 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:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362580585] [2025-01-09 04:10:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362580585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:12,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:12,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956335995] [2025-01-09 04:10:12,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:12,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:12,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:12,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:12,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:12,484 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:12,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:12,636 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2025-01-09 04:10:12,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:12,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 26 [2025-01-09 04:10:12,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:12,638 INFO L225 Difference]: With dead ends: 79 [2025-01-09 04:10:12,638 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 04:10:12,638 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:12,639 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:12,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 04:10:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 04:10:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-01-09 04:10:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-01-09 04:10:12,649 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 26 [2025-01-09 04:10:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:12,650 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-01-09 04:10:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-01-09 04:10:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:10:12,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:12,651 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] [2025-01-09 04:10:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:10:12,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:12,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash 932350083, now seen corresponding path program 1 times [2025-01-09 04:10:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980537953] [2025-01-09 04:10:12,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:12,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:12,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:10:12,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:10:12,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:12,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:12,947 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:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980537953] [2025-01-09 04:10:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980537953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256838266] [2025-01-09 04:10:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:12,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:12,949 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:13,068 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2025-01-09 04:10:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:13,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 37 [2025-01-09 04:10:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:13,070 INFO L225 Difference]: With dead ends: 83 [2025-01-09 04:10:13,070 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 04:10:13,071 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:13,071 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:13,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 04:10:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 04:10:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-01-09 04:10:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-01-09 04:10:13,084 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 37 [2025-01-09 04:10:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-01-09 04:10:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-01-09 04:10:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:10:13,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:13,085 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] [2025-01-09 04:10:13,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:10:13,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash 718933668, now seen corresponding path program 1 times [2025-01-09 04:10:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613053982] [2025-01-09 04:10:13,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:13,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:10:13,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:10:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:13,320 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:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613053982] [2025-01-09 04:10:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613053982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345861364] [2025-01-09 04:10:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:13,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:13,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:13,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:13,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:13,324 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:13,408 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-01-09 04:10:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:13,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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 48 [2025-01-09 04:10:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:13,410 INFO L225 Difference]: With dead ends: 87 [2025-01-09 04:10:13,410 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 04:10:13,410 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:13,411 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:13,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 04:10:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 04:10:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-01-09 04:10:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-01-09 04:10:13,427 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 48 [2025-01-09 04:10:13,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:13,427 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-01-09 04:10:13,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-01-09 04:10:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:10:13,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:13,431 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] [2025-01-09 04:10:13,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:10:13,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:13,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 276627555, now seen corresponding path program 1 times [2025-01-09 04:10:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:13,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360000171] [2025-01-09 04:10:13,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:13,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:10:13,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:10:13,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:13,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:10:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360000171] [2025-01-09 04:10:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360000171] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9885466] [2025-01-09 04:10:14,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:14,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:14,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:14,167 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:14,170 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:14,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:10:14,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:10:14,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:14,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 04:10:14,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:14,348 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:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:10:14,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:10:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9885466] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:15,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-01-09 04:10:15,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106293447] [2025-01-09 04:10:15,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:15,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:10:15,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:15,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:10:15,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:10:15,542 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 28 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2025-01-09 04:10:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,441 INFO L93 Difference]: Finished difference Result 113 states and 146 transitions. [2025-01-09 04:10:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:10:16,442 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) Word has length 53 [2025-01-09 04:10:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,443 INFO L225 Difference]: With dead ends: 113 [2025-01-09 04:10:16,443 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 04:10:16,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 04:10:16,447 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 50 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 329 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:10:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 04:10:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-01-09 04:10:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.225) internal successors, (49), 43 states have internal predecessors, (49), 9 states have call successors, (9), 5 states have call predecessors, (9), 12 states have return successors, (20), 13 states have call predecessors, (20), 9 states have call successors, (20) [2025-01-09 04:10:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2025-01-09 04:10:16,461 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 53 [2025-01-09 04:10:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2025-01-09 04:10:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 3.090909090909091) internal successors, (68), 25 states have internal predecessors, (68), 12 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (20), 10 states have call predecessors, (20), 12 states have call successors, (20) [2025-01-09 04:10:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2025-01-09 04:10:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:10:16,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,463 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:10:16,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:16,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash -897941691, now seen corresponding path program 1 times [2025-01-09 04:10:16,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676333202] [2025-01-09 04:10:16,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:10:16,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:10:16,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:10:17,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676333202] [2025-01-09 04:10:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676333202] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743400287] [2025-01-09 04:10:17,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:17,100 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:17,101 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:17,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:10:17,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:10:17,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:17,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:17,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:17,235 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:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:10:17,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 04:10:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743400287] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:18,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 21 [2025-01-09 04:10:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395106521] [2025-01-09 04:10:18,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:18,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:10:18,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:18,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:10:18,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:10:18,337 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 21 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 7 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 04:10:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:18,578 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2025-01-09 04:10:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:10:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 7 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 69 [2025-01-09 04:10:18,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:18,581 INFO L225 Difference]: With dead ends: 125 [2025-01-09 04:10:18,582 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 04:10:18,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:10:18,587 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:18,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 372 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 04:10:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 04:10:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 45 states have internal predecessors, (51), 9 states have call successors, (9), 5 states have call predecessors, (9), 14 states have return successors, (22), 15 states have call predecessors, (22), 9 states have call successors, (22) [2025-01-09 04:10:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2025-01-09 04:10:18,603 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 69 [2025-01-09 04:10:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:18,604 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2025-01-09 04:10:18,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.625) internal successors, (58), 18 states have internal predecessors, (58), 7 states have call successors, (17), 5 states have call predecessors, (17), 7 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 04:10:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2025-01-09 04:10:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 04:10:18,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:18,609 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 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] [2025-01-09 04:10:18,618 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:18,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:18,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:18,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash 611614993, now seen corresponding path program 2 times [2025-01-09 04:10:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:18,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942959518] [2025-01-09 04:10:18,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:18,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 04:10:18,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:10:18,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:18,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 04:10:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942959518] [2025-01-09 04:10:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942959518] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813015138] [2025-01-09 04:10:19,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:19,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:19,688 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:19,692 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:19,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-01-09 04:10:19,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 04:10:19,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:19,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:19,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 04:10:19,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:19,858 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:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 82 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 04:10:20,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 8 proven. 103 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 04:10:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813015138] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:22,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:22,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 33 [2025-01-09 04:10:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897283320] [2025-01-09 04:10:22,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:22,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 04:10:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:22,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 04:10:22,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:10:22,284 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 33 states, 25 states have (on average 2.92) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-09 04:10:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:22,622 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2025-01-09 04:10:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:10:22,623 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 25 states have (on average 2.92) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) Word has length 89 [2025-01-09 04:10:22,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:22,624 INFO L225 Difference]: With dead ends: 133 [2025-01-09 04:10:22,624 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 04:10:22,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:10:22,626 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:22,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 533 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 04:10:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 04:10:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 47 states have internal predecessors, (53), 9 states have call successors, (9), 5 states have call predecessors, (9), 16 states have return successors, (24), 17 states have call predecessors, (24), 9 states have call successors, (24) [2025-01-09 04:10:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-01-09 04:10:22,634 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 89 [2025-01-09 04:10:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:22,635 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-01-09 04:10:22,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 25 states have (on average 2.92) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (22), 7 states have call predecessors, (22), 11 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) [2025-01-09 04:10:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-01-09 04:10:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:10:22,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:22,636 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 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] [2025-01-09 04:10:22,645 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:22,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:22,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1239838173, now seen corresponding path program 3 times [2025-01-09 04:10:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:22,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579036508] [2025-01-09 04:10:22,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:22,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 10 equivalence classes. [2025-01-09 04:10:22,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 109 statements. [2025-01-09 04:10:22,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 04:10:22,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-01-09 04:10:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579036508] [2025-01-09 04:10:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579036508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188862460] [2025-01-09 04:10:23,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:23,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:23,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:23,151 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:23,154 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:23,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 10 equivalence classes. [2025-01-09 04:10:23,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 109 statements. [2025-01-09 04:10:23,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 04:10:23,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:23,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:10:23,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:23,296 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:23,382 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 36 treesize of output 13 [2025-01-09 04:10:23,403 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:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-01-09 04:10:23,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:23,575 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 7 treesize of output 3 [2025-01-09 04:10:23,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188862460] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:23,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:23,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2025-01-09 04:10:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073421736] [2025-01-09 04:10:23,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:23,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:10:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:23,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:10:23,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:10:23,741 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 04:10:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:23,946 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2025-01-09 04:10:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:10:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 109 [2025-01-09 04:10:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:23,948 INFO L225 Difference]: With dead ends: 94 [2025-01-09 04:10:23,948 INFO L226 Difference]: Without dead ends: 85 [2025-01-09 04:10:23,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:10:23,949 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:23,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 56 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-01-09 04:10:23,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2025-01-09 04:10:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.18) internal successors, (59), 52 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 20 states have return successors, (36), 22 states have call predecessors, (36), 9 states have call successors, (36) [2025-01-09 04:10:23,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2025-01-09 04:10:23,968 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 109 [2025-01-09 04:10:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:23,970 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2025-01-09 04:10:23,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2025-01-09 04:10:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2025-01-09 04:10:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 04:10:23,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:23,971 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 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] [2025-01-09 04:10:23,981 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:24,172 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,SelfDestructingSolverStorable7 [2025-01-09 04:10:24,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:24,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1280121761, now seen corresponding path program 1 times [2025-01-09 04:10:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:24,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585384521] [2025-01-09 04:10:24,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:24,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:10:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:10:24,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:24,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 16 proven. 207 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-01-09 04:10:25,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:25,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585384521] [2025-01-09 04:10:25,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585384521] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546833454] [2025-01-09 04:10:25,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:25,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:25,232 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:25,234 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:25,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 04:10:25,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 04:10:25,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:25,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:25,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:25,418 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:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-01-09 04:10:25,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2025-01-09 04:10:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546833454] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:26,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 30 [2025-01-09 04:10:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006081267] [2025-01-09 04:10:26,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 04:10:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:26,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 04:10:26,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=754, Unknown=0, NotChecked=0, Total=870 [2025-01-09 04:10:26,265 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 30 states, 23 states have (on average 2.782608695652174) internal successors, (64), 26 states have internal predecessors, (64), 11 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2025-01-09 04:10:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:26,858 INFO L93 Difference]: Finished difference Result 145 states and 196 transitions. [2025-01-09 04:10:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:10:26,858 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 23 states have (on average 2.782608695652174) internal successors, (64), 26 states have internal predecessors, (64), 11 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) Word has length 109 [2025-01-09 04:10:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:26,859 INFO L225 Difference]: With dead ends: 145 [2025-01-09 04:10:26,859 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 04:10:26,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1701, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 04:10:26,861 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 79 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:26,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 358 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:10:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 04:10:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 04:10:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 4 states have call predecessors, (8), 17 states have return successors, (23), 18 states have call predecessors, (23), 8 states have call successors, (23) [2025-01-09 04:10:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2025-01-09 04:10:26,873 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 109 [2025-01-09 04:10:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:26,874 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2025-01-09 04:10:26,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 23 states have (on average 2.782608695652174) internal successors, (64), 26 states have internal predecessors, (64), 11 states have call successors, (19), 6 states have call predecessors, (19), 12 states have return successors, (22), 11 states have call predecessors, (22), 11 states have call successors, (22) [2025-01-09 04:10:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2025-01-09 04:10:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 04:10:26,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:26,877 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-09 04:10:26,886 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:27,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:27,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:27,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash -44981675, now seen corresponding path program 2 times [2025-01-09 04:10:27,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:27,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405958538] [2025-01-09 04:10:27,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:27,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:27,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-01-09 04:10:27,132 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 04:10:27,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:27,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1885 backedges. 10 proven. 59 refuted. 0 times theorem prover too weak. 1816 trivial. 0 not checked. [2025-01-09 04:10:28,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:28,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405958538] [2025-01-09 04:10:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405958538] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008835009] [2025-01-09 04:10:28,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:28,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:28,090 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:28,093 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:28,226 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-01-09 04:10:28,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 04:10:28,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:28,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:28,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 04:10:28,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:28,337 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:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1885 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1882 trivial. 0 not checked. [2025-01-09 04:10:28,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1885 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1881 trivial. 0 not checked. [2025-01-09 04:10:29,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008835009] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:29,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:29,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 29 [2025-01-09 04:10:29,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019502336] [2025-01-09 04:10:29,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:29,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:10:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:29,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:10:29,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:29,352 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 29 states, 22 states have (on average 2.727272727272727) internal successors, (60), 25 states have internal predecessors, (60), 13 states have call successors, (20), 5 states have call predecessors, (20), 9 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) [2025-01-09 04:10:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:29,805 INFO L93 Difference]: Finished difference Result 135 states and 166 transitions. [2025-01-09 04:10:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:10:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.727272727272727) internal successors, (60), 25 states have internal predecessors, (60), 13 states have call successors, (20), 5 states have call predecessors, (20), 9 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) Word has length 212 [2025-01-09 04:10:29,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:29,807 INFO L225 Difference]: With dead ends: 135 [2025-01-09 04:10:29,807 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 04:10:29,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1394, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:10:29,808 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:29,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 234 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:10:29,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 04:10:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 04:10:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2025-01-09 04:10:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2025-01-09 04:10:29,822 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 212 [2025-01-09 04:10:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:29,823 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2025-01-09 04:10:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.727272727272727) internal successors, (60), 25 states have internal predecessors, (60), 13 states have call successors, (20), 5 states have call predecessors, (20), 9 states have return successors, (20), 10 states have call predecessors, (20), 13 states have call successors, (20) [2025-01-09 04:10:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2025-01-09 04:10:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2025-01-09 04:10:29,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:29,832 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 72, 72, 72, 16, 16, 12, 12, 12, 12, 12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:29,841 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:30,033 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,SelfDestructingSolverStorable9 [2025-01-09 04:10:30,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:30,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2093709020, now seen corresponding path program 3 times [2025-01-09 04:10:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:30,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801013138] [2025-01-09 04:10:30,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:30,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 573 statements into 14 equivalence classes. [2025-01-09 04:10:30,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 573 statements. [2025-01-09 04:10:30,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:10:30,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 17259 trivial. 0 not checked. [2025-01-09 04:10:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801013138] [2025-01-09 04:10:30,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801013138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487707984] [2025-01-09 04:10:30,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:30,433 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:30,435 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:30,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 573 statements into 14 equivalence classes. [2025-01-09 04:10:30,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 573 statements. [2025-01-09 04:10:30,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 04:10:30,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:30,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 04:10:30,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:30,784 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:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 17263 trivial. 0 not checked. [2025-01-09 04:10:30,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17271 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 17256 trivial. 0 not checked. [2025-01-09 04:10:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487707984] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:33,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:33,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 29 [2025-01-09 04:10:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411048617] [2025-01-09 04:10:33,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 04:10:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:33,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 04:10:33,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:33,500 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 29 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 25 states have internal predecessors, (52), 13 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2025-01-09 04:10:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:33,842 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2025-01-09 04:10:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:10:33,843 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 25 states have internal predecessors, (52), 13 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) Word has length 573 [2025-01-09 04:10:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:33,846 INFO L225 Difference]: With dead ends: 83 [2025-01-09 04:10:33,846 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 04:10:33,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1131 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:10:33,847 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 54 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:33,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 183 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 04:10:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 04:10:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 4 states have call predecessors, (8), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2025-01-09 04:10:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-01-09 04:10:33,857 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 573 [2025-01-09 04:10:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:33,858 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-01-09 04:10:33,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 25 states have internal predecessors, (52), 13 states have call successors, (17), 5 states have call predecessors, (17), 8 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2025-01-09 04:10:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-01-09 04:10:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2025-01-09 04:10:33,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:33,894 INFO L218 NwaCegarLoop]: trace histogram [168, 168, 144, 144, 144, 32, 32, 24, 24, 24, 24, 24, 24, 24, 12, 12, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:33,903 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:10:34,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:34,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:34,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1223675380, now seen corresponding path program 2 times [2025-01-09 04:10:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501355597] [2025-01-09 04:10:34,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:34,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1131 statements into 2 equivalence classes. [2025-01-09 04:10:34,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1131 of 1131 statements. [2025-01-09 04:10:34,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:34,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 69626 backedges. 19 proven. 699 refuted. 0 times theorem prover too weak. 68908 trivial. 0 not checked. [2025-01-09 04:10:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501355597] [2025-01-09 04:10:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501355597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387663800] [2025-01-09 04:10:39,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:39,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:39,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:39,740 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:10:39,742 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:10:40,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1131 statements into 2 equivalence classes. [2025-01-09 04:10:40,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1131 of 1131 statements. [2025-01-09 04:10:40,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:40,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 4920 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 04:10:40,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:40,652 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:40,842 INFO L134 CoverageAnalysis]: Checked inductivity of 69626 backedges. 748 proven. 15 refuted. 0 times theorem prover too weak. 68863 trivial. 0 not checked. [2025-01-09 04:10:40,842 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 69626 backedges. 712 proven. 33 refuted. 0 times theorem prover too weak. 68881 trivial. 0 not checked. [2025-01-09 04:10:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387663800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:47,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 35 [2025-01-09 04:10:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573473479] [2025-01-09 04:10:47,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:47,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 04:10:47,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:47,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 04:10:47,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 04:10:47,212 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 35 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 30 states have internal predecessors, (73), 16 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2025-01-09 04:10:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:47,504 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2025-01-09 04:10:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:10:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 30 states have internal predecessors, (73), 16 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) Word has length 1131 [2025-01-09 04:10:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:47,505 INFO L225 Difference]: With dead ends: 141 [2025-01-09 04:10:47,505 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 04:10:47,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2286 GetRequests, 2245 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:10:47,506 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 66 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:47,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 414 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 04:10:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 04:10:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 4 states have call predecessors, (8), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2025-01-09 04:10:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-01-09 04:10:47,514 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 1131 [2025-01-09 04:10:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:47,515 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-01-09 04:10:47,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 30 states have internal predecessors, (73), 16 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2025-01-09 04:10:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-01-09 04:10:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1788 [2025-01-09 04:10:47,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:47,530 INFO L218 NwaCegarLoop]: trace histogram [280, 280, 240, 240, 240, 48, 48, 40, 40, 40, 40, 40, 40, 40, 12, 12, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:47,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 04:10:47,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:47,731 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:47,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1318116108, now seen corresponding path program 3 times [2025-01-09 04:10:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421737961] [2025-01-09 04:10:47,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:47,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1787 statements into 53 equivalence classes. [2025-01-09 04:10:47,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 92 of 1787 statements. [2025-01-09 04:10:47,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:47,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 192178 backedges. 165 proven. 8 refuted. 0 times theorem prover too weak. 192005 trivial. 0 not checked. [2025-01-09 04:10:48,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:48,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421737961] [2025-01-09 04:10:48,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421737961] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:48,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566663289] [2025-01-09 04:10:48,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:48,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:48,327 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:10:48,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 04:10:48,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1787 statements into 53 equivalence classes. [2025-01-09 04:10:49,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 92 of 1787 statements. [2025-01-09 04:10:49,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 04:10:49,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:49,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 04:10:49,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:49,082 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:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 192178 backedges. 161 proven. 8 refuted. 0 times theorem prover too weak. 192009 trivial. 0 not checked. [2025-01-09 04:10:49,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 192178 backedges. 161 proven. 15 refuted. 0 times theorem prover too weak. 192002 trivial. 0 not checked. [2025-01-09 04:10:57,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566663289] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:57,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 28 [2025-01-09 04:10:57,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491604493] [2025-01-09 04:10:57,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:57,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 04:10:57,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 04:10:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:10:57,471 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 28 states, 20 states have (on average 3.1) internal successors, (62), 24 states have internal predecessors, (62), 14 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) [2025-01-09 04:10:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:57,735 INFO L93 Difference]: Finished difference Result 149 states and 175 transitions. [2025-01-09 04:10:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 04:10:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 20 states have (on average 3.1) internal successors, (62), 24 states have internal predecessors, (62), 14 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) Word has length 1787 [2025-01-09 04:10:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:57,738 INFO L225 Difference]: With dead ends: 149 [2025-01-09 04:10:57,738 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 04:10:57,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3592 GetRequests, 3559 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:10:57,740 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 59 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:57,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 251 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 04:10:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-01-09 04:10:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 50 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 23 states have return successors, (27), 23 states have call predecessors, (27), 8 states have call successors, (27) [2025-01-09 04:10:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2025-01-09 04:10:57,748 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 1787 [2025-01-09 04:10:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2025-01-09 04:10:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 20 states have (on average 3.1) internal successors, (62), 24 states have internal predecessors, (62), 14 states have call successors, (22), 6 states have call predecessors, (22), 9 states have return successors, (23), 11 states have call predecessors, (23), 14 states have call successors, (23) [2025-01-09 04:10:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2025-01-09 04:10:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3516 [2025-01-09 04:10:57,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:57,809 INFO L218 NwaCegarLoop]: trace histogram [560, 560, 480, 480, 480, 96, 96, 80, 80, 80, 80, 80, 80, 80, 20, 20, 16, 16, 16, 16, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:57,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 04:10:58,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:58,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:58,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -13580172, now seen corresponding path program 4 times [2025-01-09 04:10:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357589524] [2025-01-09 04:10:58,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:58,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 3515 statements into 2 equivalence classes. [2025-01-09 04:10:58,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 3514 of 3515 statements. [2025-01-09 04:10:58,880 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 04:10:58,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat