./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:38:03,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:38:03,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:38:03,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:38:03,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:38:03,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:38:03,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:38:03,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:38:03,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:38:03,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:38:03,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:38:03,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:38:03,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:38:03,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:38:03,109 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:38:03,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:38:03,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:03,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:38:03,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:38:03,111 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2025-03-03 14:38:03,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:38:03,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:38:03,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:38:03,362 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:38:03,362 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:38:03,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-03 14:38:04,558 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1894315/23fecc4a8c704d9d8d843f1e23fd1526/FLAG6568be17c [2025-03-03 14:38:04,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:38:04,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2025-03-03 14:38:04,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1894315/23fecc4a8c704d9d8d843f1e23fd1526/FLAG6568be17c [2025-03-03 14:38:04,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b1894315/23fecc4a8c704d9d8d843f1e23fd1526 [2025-03-03 14:38:04,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:38:04,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:38:04,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:04,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:38:04,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:38:04,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:04,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b72befa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04, skipping insertion in model container [2025-03-03 14:38:04,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:04,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:38:04,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c[2333,2346] [2025-03-03 14:38:04,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:04,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:38:04,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c[2333,2346] [2025-03-03 14:38:04,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:04,979 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:38:04,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04 WrapperNode [2025-03-03 14:38:04,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:04,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:04,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:38:04,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:38:04,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:04,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,006 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-03-03 14:38:05,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:05,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:38:05,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:38:05,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:38:05,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,014 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,031 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-03-03 14:38:05,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:38:05,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:38:05,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:38:05,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:38:05,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (1/1) ... [2025-03-03 14:38:05,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:05,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:38:05,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:38:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:38:05,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2025-03-03 14:38:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2025-03-03 14:38:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2025-03-03 14:38:05,087 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2025-03-03 14:38:05,087 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2025-03-03 14:38:05,088 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2025-03-03 14:38:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:38:05,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:38:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:38:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:38:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:38:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:38:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:38:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:38:05,176 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:38:05,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:38:05,306 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset; [2025-03-03 14:38:05,319 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 14:38:05,319 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:38:05,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:38:05,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:38:05,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:05 BoogieIcfgContainer [2025-03-03 14:38:05,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:38:05,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:38:05,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:38:05,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:38:05,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:38:04" (1/3) ... [2025-03-03 14:38:05,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eab05bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:05, skipping insertion in model container [2025-03-03 14:38:05,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:04" (2/3) ... [2025-03-03 14:38:05,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eab05bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:05, skipping insertion in model container [2025-03-03 14:38:05,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:05" (3/3) ... [2025-03-03 14:38:05,336 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_4.c [2025-03-03 14:38:05,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:38:05,349 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_4.c that has 5 procedures, 42 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:38:05,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:38:05,397 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;@a78ecb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:38:05,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:38:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 14:38:05,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:05,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:05,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:05,409 INFO L85 PathProgramCache]: Analyzing trace with hash -257936065, now seen corresponding path program 1 times [2025-03-03 14:38:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:05,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597337622] [2025-03-03 14:38:05,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:05,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 14:38:05,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 14:38:05,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:05,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597337622] [2025-03-03 14:38:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597337622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:05,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501751056] [2025-03-03 14:38:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:05,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:05,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:05,867 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,032 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2025-03-03 14:38:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-03 14:38:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,038 INFO L225 Difference]: With dead ends: 57 [2025-03-03 14:38:06,039 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 14:38:06,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:06,045 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 71 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:06,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 14:38:06,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 14:38:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-03 14:38:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2025-03-03 14:38:06,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 15 [2025-03-03 14:38:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,077 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2025-03-03 14:38:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:38:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2025-03-03 14:38:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 14:38:06,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:06,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:38:06,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1338134008, now seen corresponding path program 1 times [2025-03-03 14:38:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:06,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098318772] [2025-03-03 14:38:06,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:06,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 14:38:06,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 14:38:06,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:38:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098318772] [2025-03-03 14:38:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098318772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:06,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077851775] [2025-03-03 14:38:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:06,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:06,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:06,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:06,292 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:06,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,401 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2025-03-03 14:38:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:06,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2025-03-03 14:38:06,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,402 INFO L225 Difference]: With dead ends: 79 [2025-03-03 14:38:06,402 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 14:38:06,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:06,403 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 82 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 14:38:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-03 14:38:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-03 14:38:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2025-03-03 14:38:06,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 26 [2025-03-03 14:38:06,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,413 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2025-03-03 14:38:06,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:06,414 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2025-03-03 14:38:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:38:06,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:06,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:38:06,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:06,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:06,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1204084236, now seen corresponding path program 1 times [2025-03-03 14:38:06,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:06,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278134259] [2025-03-03 14:38:06,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:06,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:06,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:38:06,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:38:06,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:38:06,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:06,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278134259] [2025-03-03 14:38:06,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278134259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:06,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:06,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:06,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368643168] [2025-03-03 14:38:06,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:06,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:06,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:06,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:06,605 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:38:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,678 INFO L93 Difference]: Finished difference Result 83 states and 107 transitions. [2025-03-03 14:38:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2025-03-03 14:38:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,679 INFO L225 Difference]: With dead ends: 83 [2025-03-03 14:38:06,679 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 14:38:06,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:06,680 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 109 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 14:38:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-03 14:38:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 32 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-03 14:38:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2025-03-03 14:38:06,685 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 37 [2025-03-03 14:38:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,686 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2025-03-03 14:38:06,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:38:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2025-03-03 14:38:06,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:38:06,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,687 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:06,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:38:06,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash -681955355, now seen corresponding path program 1 times [2025-03-03 14:38:06,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:06,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580088294] [2025-03-03 14:38:06,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:06,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:06,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:38:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:38:06,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:38:06,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:06,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580088294] [2025-03-03 14:38:06,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580088294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:06,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:06,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:38:06,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154137731] [2025-03-03 14:38:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:06,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:06,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:38:06,871 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:38:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:06,932 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-03-03 14:38:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) Word has length 48 [2025-03-03 14:38:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:06,933 INFO L225 Difference]: With dead ends: 87 [2025-03-03 14:38:06,933 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:38:06,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:06,934 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:06,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 135 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:38:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 14:38:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-03 14:38:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2025-03-03 14:38:06,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 48 [2025-03-03 14:38:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:06,940 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2025-03-03 14:38:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:38:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2025-03-03 14:38:06,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:38:06,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:06,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:38:06,942 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1367415055, now seen corresponding path program 1 times [2025-03-03 14:38:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376059902] [2025-03-03 14:38:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:06,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:38:06,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:38:06,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:06,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:38:07,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376059902] [2025-03-03 14:38:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376059902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252375171] [2025-03-03 14:38:07,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:07,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:07,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:07,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:38:07,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:38:07,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:38:07,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:07,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:07,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:38:07,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:07,515 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-03-03 14:38:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:38:07,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:38:08,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252375171] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:08,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:08,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2025-03-03 14:38:08,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087479792] [2025-03-03 14:38:08,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:38:08,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:38:08,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:38:08,296 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 25 states, 19 states have (on average 3.263157894736842) internal successors, (62), 21 states have internal predecessors, (62), 11 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2025-03-03 14:38:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,790 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2025-03-03 14:38:08,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:38:08,791 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 3.263157894736842) internal successors, (62), 21 states have internal predecessors, (62), 11 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) Word has length 53 [2025-03-03 14:38:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,791 INFO L225 Difference]: With dead ends: 96 [2025-03-03 14:38:08,792 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 14:38:08,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:38:08,793 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 80 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 134 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:38:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 14:38:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-03 14:38:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 14:38:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-03 14:38:08,799 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 53 [2025-03-03 14:38:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,799 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-03 14:38:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 3.263157894736842) internal successors, (62), 21 states have internal predecessors, (62), 11 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2025-03-03 14:38:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-03 14:38:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:38:08,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,801 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:38:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash -676194833, now seen corresponding path program 1 times [2025-03-03 14:38:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112620845] [2025-03-03 14:38:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:38:09,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:38:09,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:38:09,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112620845] [2025-03-03 14:38:09,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112620845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:09,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:09,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:38:09,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740433823] [2025-03-03 14:38:09,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:38:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:38:09,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,081 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:38:09,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,096 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2025-03-03 14:38:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:38:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-03-03 14:38:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,097 INFO L225 Difference]: With dead ends: 60 [2025-03-03 14:38:09,097 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 14:38:09,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,098 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:09,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:09,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 14:38:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-03-03 14:38:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 14:38:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-03 14:38:09,104 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 69 [2025-03-03 14:38:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-03 14:38:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:38:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-03 14:38:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:38:09,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,110 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:09,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:38:09,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -675271312, now seen corresponding path program 1 times [2025-03-03 14:38:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722252962] [2025-03-03 14:38:09,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:38:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:38:09,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-03 14:38:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722252962] [2025-03-03 14:38:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722252962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:09,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:38:09,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480320545] [2025-03-03 14:38:09,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:38:09,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:38:09,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,182 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:38:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:09,199 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-03-03 14:38:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:38:09,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2025-03-03 14:38:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:09,200 INFO L225 Difference]: With dead ends: 60 [2025-03-03 14:38:09,201 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:38:09,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:38:09,201 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:09,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:38:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2025-03-03 14:38:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 14:38:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-03-03 14:38:09,212 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 69 [2025-03-03 14:38:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,212 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-03-03 14:38:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-03 14:38:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-03-03 14:38:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:38:09,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,214 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:09,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:38:09,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -675270351, now seen corresponding path program 1 times [2025-03-03 14:38:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200598933] [2025-03-03 14:38:09,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:38:09,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:38:09,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 14:38:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200598933] [2025-03-03 14:38:09,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200598933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:09,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930608644] [2025-03-03 14:38:09,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:09,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:09,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:09,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:38:09,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:38:09,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:38:09,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:09,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:38:09,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:09,684 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-03-03 14:38:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:38:09,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:38:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930608644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:10,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:10,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2025-03-03 14:38:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306928471] [2025-03-03 14:38:10,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:10,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:38:10,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:10,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:38:10,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:38:10,437 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 22 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-03 14:38:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:10,624 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2025-03-03 14:38:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:38:10,624 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 8 states have call successors, (20) Word has length 69 [2025-03-03 14:38:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:10,625 INFO L225 Difference]: With dead ends: 113 [2025-03-03 14:38:10,627 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 14:38:10,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:38:10,628 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 39 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:10,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 292 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 14:38:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 14:38:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (17), 13 states have call predecessors, (17), 8 states have call successors, (17) [2025-03-03 14:38:10,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2025-03-03 14:38:10,634 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 69 [2025-03-03 14:38:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:10,634 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2025-03-03 14:38:10,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 16 states have (on average 4.0) internal successors, (64), 19 states have internal predecessors, (64), 8 states have call successors, (20), 5 states have call predecessors, (20), 7 states have return successors, (20), 5 states have call predecessors, (20), 8 states have call successors, (20) [2025-03-03 14:38:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2025-03-03 14:38:10,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:38:10,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:10,639 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:10,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:10,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 14:38:10,839 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:10,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1644516669, now seen corresponding path program 2 times [2025-03-03 14:38:10,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:10,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886883251] [2025-03-03 14:38:10,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:10,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:10,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-03 14:38:10,860 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:38:10,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 12 proven. 91 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-03 14:38:11,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886883251] [2025-03-03 14:38:11,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886883251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:11,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874584011] [2025-03-03 14:38:11,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:11,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:11,471 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:11,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:38:11,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-03-03 14:38:11,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:38:11,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:11,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:11,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 14:38:11,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:11,611 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-03-03 14:38:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 15 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 14:38:11,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 27 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:38:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874584011] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:13,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:13,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 18] total 34 [2025-03-03 14:38:13,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181304976] [2025-03-03 14:38:13,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:13,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 14:38:13,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 14:38:13,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:38:13,680 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 34 states, 25 states have (on average 2.76) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-03 14:38:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:13,909 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2025-03-03 14:38:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:38:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 25 states have (on average 2.76) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) Word has length 89 [2025-03-03 14:38:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:13,911 INFO L225 Difference]: With dead ends: 121 [2025-03-03 14:38:13,911 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 14:38:13,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:38:13,913 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 29 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:13,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 425 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 14:38:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 14:38:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-03 14:38:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2025-03-03 14:38:13,918 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 89 [2025-03-03 14:38:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:13,919 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2025-03-03 14:38:13,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 25 states have (on average 2.76) internal successors, (69), 29 states have internal predecessors, (69), 11 states have call successors, (21), 7 states have call predecessors, (21), 11 states have return successors, (25), 9 states have call predecessors, (25), 11 states have call successors, (25) [2025-03-03 14:38:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2025-03-03 14:38:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:38:13,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:13,920 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:13,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:14,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,120 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:14,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash 541770825, now seen corresponding path program 3 times [2025-03-03 14:38:14,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:14,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105720694] [2025-03-03 14:38:14,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:14,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 10 equivalence classes. [2025-03-03 14:38:14,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 109 statements. [2025-03-03 14:38:14,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:38:14,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-03 14:38:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105720694] [2025-03-03 14:38:14,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105720694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:14,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315504042] [2025-03-03 14:38:14,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:14,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:14,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:14,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:38:14,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 109 statements into 10 equivalence classes. [2025-03-03 14:38:14,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 109 statements. [2025-03-03 14:38:14,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:38:14,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:14,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 14:38:14,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:14,427 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-03-03 14:38:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2025-03-03 14:38:14,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-03 14:38:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315504042] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:14,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:14,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2025-03-03 14:38:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669380177] [2025-03-03 14:38:14,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:14,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:38:14,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:14,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:38:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:38:14,976 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:38:15,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:15,262 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-03-03 14:38:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:38:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 9 states have call successors, (14) Word has length 109 [2025-03-03 14:38:15,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:15,264 INFO L225 Difference]: With dead ends: 79 [2025-03-03 14:38:15,264 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 14:38:15,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:38:15,264 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:15,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 181 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 14:38:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-03 14:38:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.175) internal successors, (47), 44 states have internal predecessors, (47), 8 states have call successors, (8), 4 states have call predecessors, (8), 15 states have return successors, (19), 15 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-03 14:38:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2025-03-03 14:38:15,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 109 [2025-03-03 14:38:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2025-03-03 14:38:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 4 states have call predecessors, (13), 6 states have return successors, (14), 8 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:38:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2025-03-03 14:38:15,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 14:38:15,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:15,272 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 30, 30, 30, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:15,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:15,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:15,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:15,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1692264404, now seen corresponding path program 2 times [2025-03-03 14:38:15,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:15,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852756129] [2025-03-03 14:38:15,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:15,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:15,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 297 statements into 2 equivalence classes. [2025-03-03 14:38:15,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 14:38:15,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:15,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3246 backedges. 20 proven. 923 refuted. 0 times theorem prover too weak. 2303 trivial. 0 not checked. [2025-03-03 14:38:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852756129] [2025-03-03 14:38:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852756129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929145920] [2025-03-03 14:38:17,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:17,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:17,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:17,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:17,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:38:17,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 297 statements into 2 equivalence classes. [2025-03-03 14:38:17,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 14:38:17,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:17,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:17,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 14:38:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:17,415 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-03-03 14:38:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3246 backedges. 1468 proven. 8 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-03 14:38:17,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3246 backedges. 8 proven. 129 refuted. 0 times theorem prover too weak. 3109 trivial. 0 not checked. [2025-03-03 14:38:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929145920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:18,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:18,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2025-03-03 14:38:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113213696] [2025-03-03 14:38:18,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:18,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 14:38:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:18,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 14:38:18,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1033, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:38:18,790 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 35 states, 27 states have (on average 3.037037037037037) internal successors, (82), 30 states have internal predecessors, (82), 13 states have call successors, (29), 7 states have call predecessors, (29), 14 states have return successors, (35), 14 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-03 14:38:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:19,186 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2025-03-03 14:38:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:38:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 3.037037037037037) internal successors, (82), 30 states have internal predecessors, (82), 13 states have call successors, (29), 7 states have call predecessors, (29), 14 states have return successors, (35), 14 states have call predecessors, (35), 13 states have call successors, (35) Word has length 297 [2025-03-03 14:38:19,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:19,187 INFO L225 Difference]: With dead ends: 129 [2025-03-03 14:38:19,187 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 14:38:19,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 14:38:19,188 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 75 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:19,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 420 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 14:38:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 14:38:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 4 states have call predecessors, (8), 17 states have return successors, (21), 17 states have call predecessors, (21), 8 states have call successors, (21) [2025-03-03 14:38:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-03 14:38:19,194 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 297 [2025-03-03 14:38:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:19,195 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-03 14:38:19,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 3.037037037037037) internal successors, (82), 30 states have internal predecessors, (82), 13 states have call successors, (29), 7 states have call predecessors, (29), 14 states have return successors, (35), 14 states have call predecessors, (35), 13 states have call successors, (35) [2025-03-03 14:38:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-03 14:38:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-03-03 14:38:19,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:19,202 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 54, 54, 54, 12, 12, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:19,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:19,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:38:19,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1495385747, now seen corresponding path program 3 times [2025-03-03 14:38:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922113693] [2025-03-03 14:38:19,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:19,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 450 statements into 14 equivalence classes. [2025-03-03 14:38:19,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 450 statements. [2025-03-03 14:38:19,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:19,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9717 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9664 trivial. 0 not checked. [2025-03-03 14:38:19,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922113693] [2025-03-03 14:38:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922113693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304205234] [2025-03-03 14:38:19,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:19,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:19,597 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:19,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:38:19,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 450 statements into 14 equivalence classes. [2025-03-03 14:38:19,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 450 statements. [2025-03-03 14:38:19,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:38:19,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:19,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 14:38:19,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:19,818 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-03-03 14:38:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 9717 backedges. 52 proven. 3 refuted. 0 times theorem prover too weak. 9662 trivial. 0 not checked. [2025-03-03 14:38:19,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9717 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 9663 trivial. 0 not checked. [2025-03-03 14:38:21,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304205234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:21,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:21,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-03 14:38:21,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249654483] [2025-03-03 14:38:21,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:21,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:38:21,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:21,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:38:21,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:38:21,562 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 11 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-03 14:38:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:21,773 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2025-03-03 14:38:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 11 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) Word has length 450 [2025-03-03 14:38:21,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:21,774 INFO L225 Difference]: With dead ends: 137 [2025-03-03 14:38:21,774 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 14:38:21,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:38:21,775 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:21,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 226 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 14:38:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-03 14:38:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 4 states have call predecessors, (8), 19 states have return successors, (23), 19 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-03 14:38:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2025-03-03 14:38:21,781 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 450 [2025-03-03 14:38:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:21,781 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2025-03-03 14:38:21,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 21 states have internal predecessors, (57), 11 states have call successors, (19), 5 states have call predecessors, (19), 7 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2025-03-03 14:38:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2025-03-03 14:38:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1255 [2025-03-03 14:38:21,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:21,805 INFO L218 NwaCegarLoop]: trace histogram [189, 189, 162, 162, 162, 36, 36, 27, 27, 27, 27, 27, 27, 27, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:21,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:22,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:22,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2110796985, now seen corresponding path program 4 times [2025-03-03 14:38:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071427880] [2025-03-03 14:38:22,010 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:22,091 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1254 statements into 2 equivalence classes. [2025-03-03 14:38:22,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1253 of 1254 statements. [2025-03-03 14:38:22,217 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 20 proven. 787 refuted. 0 times theorem prover too weak. 87276 trivial. 0 not checked. [2025-03-03 14:38:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071427880] [2025-03-03 14:38:26,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071427880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:26,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711103969] [2025-03-03 14:38:26,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:38:26,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:26,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:26,808 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:26,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:38:27,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1254 statements into 2 equivalence classes. [2025-03-03 14:38:27,522 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 1253 of 1254 statements. [2025-03-03 14:38:27,523 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:38:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:27,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 5370 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 14:38:27,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:27,574 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-03-03 14:38:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 44158 proven. 15 refuted. 0 times theorem prover too weak. 43910 trivial. 0 not checked. [2025-03-03 14:38:27,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 88083 backedges. 410 proven. 427 refuted. 0 times theorem prover too weak. 87246 trivial. 0 not checked. [2025-03-03 14:38:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711103969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:32,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:32,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 34 [2025-03-03 14:38:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731207437] [2025-03-03 14:38:32,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:32,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 14:38:32,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:32,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 14:38:32,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:38:32,615 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 34 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 29 states have internal predecessors, (83), 15 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-03 14:38:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:32,887 INFO L93 Difference]: Finished difference Result 145 states and 174 transitions. [2025-03-03 14:38:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 29 states have internal predecessors, (83), 15 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 15 states have call successors, (37) Word has length 1254 [2025-03-03 14:38:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:32,888 INFO L225 Difference]: With dead ends: 145 [2025-03-03 14:38:32,888 INFO L226 Difference]: Without dead ends: 76 [2025-03-03 14:38:32,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2533 GetRequests, 2493 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:38:32,889 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 52 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:32,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 383 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-03 14:38:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-03 14:38:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 50 states have internal predecessors, (53), 8 states have call successors, (8), 4 states have call predecessors, (8), 21 states have return successors, (25), 21 states have call predecessors, (25), 8 states have call successors, (25) [2025-03-03 14:38:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2025-03-03 14:38:32,897 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 1254 [2025-03-03 14:38:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2025-03-03 14:38:32,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 3.1923076923076925) internal successors, (83), 29 states have internal predecessors, (83), 15 states have call successors, (30), 7 states have call predecessors, (30), 11 states have return successors, (37), 14 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-03 14:38:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2025-03-03 14:38:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1993 [2025-03-03 14:38:32,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:32,933 INFO L218 NwaCegarLoop]: trace histogram [315, 315, 270, 270, 270, 54, 54, 45, 45, 45, 45, 45, 45, 45, 12, 12, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:32,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:38:33,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:33,134 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:33,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1086993301, now seen corresponding path program 5 times [2025-03-03 14:38:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293835006] [2025-03-03 14:38:33,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:38:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:33,269 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1992 statements into 36 equivalence classes. [2025-03-03 14:38:35,313 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) and asserted 1829 of 1992 statements. [2025-03-03 14:38:35,314 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2025-03-03 14:38:35,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 243234 backedges. 28 proven. 1831 refuted. 0 times theorem prover too weak. 241375 trivial. 0 not checked. [2025-03-03 14:38:47,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293835006] [2025-03-03 14:38:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293835006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462745032] [2025-03-03 14:38:47,159 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:38:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:47,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:38:47,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:38:47,615 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1992 statements into 36 equivalence classes.