./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.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_6.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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:13,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:13,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:10:13,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:13,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:13,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:13,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:13,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:13,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:13,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:13,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:13,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:13,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:13,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:13,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:13,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:13,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:13,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:13,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:13,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:13,580 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2025-01-09 04:10:13,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:13,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:13,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:13,818 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:13,819 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:13,819 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_6.c [2025-01-09 04:10:15,087 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3f3d95a9/a01be515938d46e386066793021ea5ba/FLAG18bfc02c9 [2025-01-09 04:10:15,320 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:15,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-01-09 04:10:15,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3f3d95a9/a01be515938d46e386066793021ea5ba/FLAG18bfc02c9 [2025-01-09 04:10:15,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3f3d95a9/a01be515938d46e386066793021ea5ba [2025-01-09 04:10:15,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:15,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:15,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:15,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:15,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:15,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b97dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:15,469 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_6.c[2667,2680] [2025-01-09 04:10:15,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:15,478 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:15,496 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_6.c[2667,2680] [2025-01-09 04:10:15,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:15,506 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:15,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15 WrapperNode [2025-01-09 04:10:15,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:15,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:15,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:15,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:15,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,534 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2025-01-09 04:10:15,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:15,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:15,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:15,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:15,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,553 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:15,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:15,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:15,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:15,563 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:15,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (1/1) ... [2025-01-09 04:10:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:15,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:15,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:10:15,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2025-01-09 04:10:15,604 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:10:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-01-09 04:10:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2025-01-09 04:10:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2025-01-09 04:10:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:15,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-01-09 04:10:15,606 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-01-09 04:10:15,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:15,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:15,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:15,914 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:15,914 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:15,921 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:15,921 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:15,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:15 BoogieIcfgContainer [2025-01-09 04:10:15,921 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:15,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:15,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:15,926 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:15,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:15" (1/3) ... [2025-01-09 04:10:15,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d19f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:15" (2/3) ... [2025-01-09 04:10:15,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d19f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:15, skipping insertion in model container [2025-01-09 04:10:15,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:15" (3/3) ... [2025-01-09 04:10:15,927 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_6.c [2025-01-09 04:10:15,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:15,938 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_6.c that has 5 procedures, 46 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:10:15,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:15,992 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;@432fd7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:15,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 32 states have (on average 1.375) internal successors, (44), 37 states have internal predecessors, (44), 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:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 04:10:15,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -103108912, now seen corresponding path program 1 times [2025-01-09 04:10:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859391511] [2025-01-09 04:10:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 04:10:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 04:10:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859391511] [2025-01-09 04:10:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859391511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:10:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030648442] [2025-01-09 04:10:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:10:16,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:10:16,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:10:16,181 INFO L87 Difference]: Start difference. First operand has 46 states, 32 states have (on average 1.375) internal successors, (44), 37 states have internal predecessors, (44), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,204 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2025-01-09 04:10:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:10:16,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 04:10:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,209 INFO L225 Difference]: With dead ends: 64 [2025-01-09 04:10:16,210 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 04:10:16,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:10:16,213 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 04:10:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-01-09 04:10:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 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:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2025-01-09 04:10:16,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 12 [2025-01-09 04:10:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,237 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2025-01-09 04:10:16,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2025-01-09 04:10:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 04:10:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:16,238 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1496017736, now seen corresponding path program 1 times [2025-01-09 04:10:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538624236] [2025-01-09 04:10:16,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 04:10:16,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 04:10:16,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538624236] [2025-01-09 04:10:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538624236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:10:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150618307] [2025-01-09 04:10:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:10:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:10:16,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:10:16,338 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,362 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2025-01-09 04:10:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:10:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 04:10:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,367 INFO L225 Difference]: With dead ends: 86 [2025-01-09 04:10:16,367 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 04:10:16,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:10:16,368 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 04:10:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-01-09 04:10:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 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:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2025-01-09 04:10:16,376 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 14 [2025-01-09 04:10:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-01-09 04:10:16,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:10:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2025-01-09 04:10:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 04:10:16,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:10:16,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1092257674, now seen corresponding path program 1 times [2025-01-09 04:10:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737308787] [2025-01-09 04:10:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:10:16,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:10:16,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737308787] [2025-01-09 04:10:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737308787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050576505] [2025-01-09 04:10:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:16,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:16,494 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:16,496 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:16,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:10:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:10:16,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:16,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:16,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:10:16,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:16,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050576505] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:16,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:16,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 04:10:16,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141240066] [2025-01-09 04:10:16,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:16,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:10:16,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:10:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:16,636 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:16,680 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2025-01-09 04:10:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2025-01-09 04:10:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:16,681 INFO L225 Difference]: With dead ends: 94 [2025-01-09 04:10:16,681 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 04:10:16,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:16,682 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:16,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:16,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 04:10:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 04:10:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:10:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-01-09 04:10:16,690 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 21 [2025-01-09 04:10:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:16,690 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-01-09 04:10:16,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:10:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-01-09 04:10:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 04:10:16,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:16,691 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:16,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:16,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:16,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:16,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:16,893 INFO L85 PathProgramCache]: Analyzing trace with hash 847937848, now seen corresponding path program 2 times [2025-01-09 04:10:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176715622] [2025-01-09 04:10:16,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:16,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 04:10:16,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:10:16,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,148 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 04:10:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176715622] [2025-01-09 04:10:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176715622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:17,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823208937] [2025-01-09 04:10:17,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:17,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:17,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:17,151 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,152 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,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 04:10:17,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 04:10:17,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:17,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:17,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:10:17,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 04:10:17,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 04:10:17,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823208937] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:17,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:17,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-01-09 04:10:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687858158] [2025-01-09 04:10:17,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:17,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:10:17,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:17,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:10:17,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:10:17,361 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:10:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:17,596 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2025-01-09 04:10:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:10:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 42 [2025-01-09 04:10:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:17,598 INFO L225 Difference]: With dead ends: 111 [2025-01-09 04:10:17,598 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 04:10:17,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:10:17,599 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 131 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 04:10:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 04:10:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-09 04:10:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-01-09 04:10:17,610 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 42 [2025-01-09 04:10:17,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:17,610 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-01-09 04:10:17,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:10:17,610 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-01-09 04:10:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 04:10:17,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:17,615 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:17,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:17,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:17,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash 109686086, now seen corresponding path program 1 times [2025-01-09 04:10:17,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:17,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-01-09 04:10:17,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:17,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:17,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:10:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:10:17,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:17,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-01-09 04:10:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141021097] [2025-01-09 04:10:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141021097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516478184] [2025-01-09 04:10:18,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:18,203 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:18,206 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:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 04:10:18,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 04:10:18,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:18,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:18,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 04:10:18,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 04:10:18,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 04:10:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516478184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:18,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-01-09 04:10:18,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865935891] [2025-01-09 04:10:18,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:10:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:18,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:10:18,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:10:18,597 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 04:10:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:18,767 INFO L93 Difference]: Finished difference Result 181 states and 267 transitions. [2025-01-09 04:10:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 04:10:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 122 [2025-01-09 04:10:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:18,768 INFO L225 Difference]: With dead ends: 181 [2025-01-09 04:10:18,768 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 04:10:18,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:10:18,769 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:18,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 186 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:18,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 04:10:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 04:10:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 89 states have internal predecessors, (98), 31 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (33), 31 states have call predecessors, (33), 31 states have call successors, (33) [2025-01-09 04:10:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2025-01-09 04:10:18,784 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 122 [2025-01-09 04:10:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:18,784 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2025-01-09 04:10:18,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-01-09 04:10:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2025-01-09 04:10:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2025-01-09 04:10:18,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:18,796 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 48, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:18,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:10:19,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:19,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:19,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:19,001 INFO L85 PathProgramCache]: Analyzing trace with hash 328463344, now seen corresponding path program 1 times [2025-01-09 04:10:19,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:19,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705659608] [2025-01-09 04:10:19,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:19,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:19,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-01-09 04:10:19,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-01-09 04:10:19,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:19,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 58 proven. 391 refuted. 0 times theorem prover too weak. 12275 trivial. 0 not checked. [2025-01-09 04:10:20,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:20,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705659608] [2025-01-09 04:10:20,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705659608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:20,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550646829] [2025-01-09 04:10:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:20,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:20,480 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:20,481 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:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-01-09 04:10:21,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-01-09 04:10:21,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:21,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:21,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 5114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:10:21,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 11988 trivial. 0 not checked. [2025-01-09 04:10:21,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:22,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 11988 trivial. 0 not checked. [2025-01-09 04:10:22,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550646829] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:22,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-01-09 04:10:22,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102767686] [2025-01-09 04:10:22,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:10:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:22,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:10:22,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:10:22,332 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2025-01-09 04:10:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:22,447 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2025-01-09 04:10:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:10:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 716 [2025-01-09 04:10:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:22,449 INFO L225 Difference]: With dead ends: 283 [2025-01-09 04:10:22,450 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 04:10:22,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 1422 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:10:22,452 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:22,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 195 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:10:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 04:10:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 04:10:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.131578947368421) internal successors, (129), 118 states have internal predecessors, (129), 43 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 04:10:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2025-01-09 04:10:22,468 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 716 [2025-01-09 04:10:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:22,468 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2025-01-09 04:10:22,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2025-01-09 04:10:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2025-01-09 04:10:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2025-01-09 04:10:22,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:22,508 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:22,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:10:22,712 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,SelfDestructingSolverStorable5 [2025-01-09 04:10:22,712 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:22,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1077815300, now seen corresponding path program 1 times [2025-01-09 04:10:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:22,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827620500] [2025-01-09 04:10:22,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-01-09 04:10:22,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-01-09 04:10:22,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:22,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 41004 backedges. 88 proven. 805 refuted. 0 times theorem prover too weak. 40111 trivial. 0 not checked. [2025-01-09 04:10:25,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827620500] [2025-01-09 04:10:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827620500] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742888191] [2025-01-09 04:10:25,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:25,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:25,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:25,549 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,550 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,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-01-09 04:10:26,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-01-09 04:10:26,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:26,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:26,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 9350 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:26,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:26,848 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:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 41004 backedges. 2217 proven. 3 refuted. 0 times theorem prover too weak. 38784 trivial. 0 not checked. [2025-01-09 04:10:26,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 41004 backedges. 82 proven. 669 refuted. 0 times theorem prover too weak. 40253 trivial. 0 not checked. [2025-01-09 04:10:28,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742888191] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:28,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:28,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 21 [2025-01-09 04:10:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260080087] [2025-01-09 04:10:28,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:28,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:10:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:28,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:10:28,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:10:28,826 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand has 21 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 9 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-09 04:10:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:29,134 INFO L93 Difference]: Finished difference Result 329 states and 512 transitions. [2025-01-09 04:10:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:10:29,134 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 9 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) Word has length 1464 [2025-01-09 04:10:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:29,136 INFO L225 Difference]: With dead ends: 329 [2025-01-09 04:10:29,136 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 04:10:29,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2941 GetRequests, 2914 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2025-01-09 04:10:29,138 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:29,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 244 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 04:10:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-01-09 04:10:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 116 states have (on average 1.1293103448275863) internal successors, (131), 120 states have internal predecessors, (131), 43 states have call successors, (43), 4 states have call predecessors, (43), 9 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-01-09 04:10:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 222 transitions. [2025-01-09 04:10:29,154 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 222 transitions. Word has length 1464 [2025-01-09 04:10:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:29,154 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 222 transitions. [2025-01-09 04:10:29,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 4.625) internal successors, (74), 17 states have internal predecessors, (74), 9 states have call successors, (25), 6 states have call predecessors, (25), 7 states have return successors, (27), 6 states have call predecessors, (27), 9 states have call successors, (27) [2025-01-09 04:10:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 222 transitions. [2025-01-09 04:10:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3013 [2025-01-09 04:10:29,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:29,321 INFO L218 NwaCegarLoop]: trace histogram [144, 144, 144, 144, 144, 144, 108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:29,346 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:29,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:29,524 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1417749952, now seen corresponding path program 1 times [2025-01-09 04:10:29,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086261692] [2025-01-09 04:10:29,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3012 statements into 1 equivalence classes. [2025-01-09 04:10:29,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3012 of 3012 statements. [2025-01-09 04:10:29,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 174366 backedges. 90 proven. 2485 refuted. 0 times theorem prover too weak. 171791 trivial. 0 not checked. [2025-01-09 04:10:43,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086261692] [2025-01-09 04:10:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086261692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014176044] [2025-01-09 04:10:43,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:43,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:43,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:43,188 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:43,191 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:43,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3012 statements into 1 equivalence classes. [2025-01-09 04:10:45,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3012 of 3012 statements. [2025-01-09 04:10:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:45,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 18062 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 04:10:45,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:45,895 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:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 174366 backedges. 67916 proven. 3 refuted. 0 times theorem prover too weak. 106447 trivial. 0 not checked. [2025-01-09 04:10:46,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 174366 backedges. 1418 proven. 1644 refuted. 0 times theorem prover too weak. 171304 trivial. 0 not checked. [2025-01-09 04:10:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014176044] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:50,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:50,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-01-09 04:10:50,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624666802] [2025-01-09 04:10:50,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 04:10:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:50,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 04:10:50,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-01-09 04:10:50,422 INFO L87 Difference]: Start difference. First operand 169 states and 222 transitions. Second operand has 24 states, 18 states have (on average 4.5) internal successors, (81), 20 states have internal predecessors, (81), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) [2025-01-09 04:10:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:50,755 INFO L93 Difference]: Finished difference Result 337 states and 486 transitions. [2025-01-09 04:10:50,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:10:50,755 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 4.5) internal successors, (81), 20 states have internal predecessors, (81), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) Word has length 3012 [2025-01-09 04:10:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:50,757 INFO L225 Difference]: With dead ends: 337 [2025-01-09 04:10:50,757 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 04:10:50,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6042 GetRequests, 6010 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 04:10:50,758 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 30 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:50,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 488 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 04:10:50,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-09 04:10:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 118 states have (on average 1.1271186440677967) internal successors, (133), 122 states have internal predecessors, (133), 43 states have call successors, (43), 4 states have call predecessors, (43), 11 states have return successors, (50), 46 states have call predecessors, (50), 43 states have call successors, (50) [2025-01-09 04:10:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 226 transitions. [2025-01-09 04:10:50,783 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 226 transitions. Word has length 3012 [2025-01-09 04:10:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 226 transitions. [2025-01-09 04:10:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 4.5) internal successors, (81), 20 states have internal predecessors, (81), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) [2025-01-09 04:10:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 226 transitions. [2025-01-09 04:10:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4885 [2025-01-09 04:10:50,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:50,869 INFO L218 NwaCegarLoop]: trace histogram [432, 432, 288, 288, 288, 216, 216, 144, 144, 144, 144, 144, 144, 144, 144, 144, 108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:50,903 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:51,072 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,SelfDestructingSolverStorable7 [2025-01-09 04:10:51,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1908736576, now seen corresponding path program 2 times [2025-01-09 04:10:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699099369] [2025-01-09 04:10:51,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:51,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4884 statements into 2 equivalence classes. [2025-01-09 04:10:52,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4884 of 4884 statements. [2025-01-09 04:10:52,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 619254 backedges. 94 proven. 7361 refuted. 0 times theorem prover too weak. 611799 trivial. 0 not checked. [2025-01-09 04:11:41,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699099369] [2025-01-09 04:11:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699099369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116254711] [2025-01-09 04:11:41,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:11:41,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:41,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:41,742 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:11:41,743 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:11:42,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4884 statements into 2 equivalence classes. [2025-01-09 04:11:45,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4884 of 4884 statements. [2025-01-09 04:11:45,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:11:45,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:45,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 25622 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 04:11:45,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:45,385 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:11:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 619254 backedges. 109130 proven. 8 refuted. 0 times theorem prover too weak. 510116 trivial. 0 not checked. [2025-01-09 04:11:45,498 INFO L312 TraceCheckSpWp]: Computing backward predicates...