./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_6.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 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:38:05,533 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:38:05,589 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:05,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:38:05,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:38:05,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:38:05,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:38:05,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:38:05,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:38:05,611 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:38:05,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:38:05,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:38:05,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:38:05,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:38:05,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:38:05,613 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:38:05,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:05,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:38:05,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:38:05,614 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 -> 76648bc32cf18f500eee0df5c8487c6c0f67ad1050d870973d578953c78cde5c [2025-03-03 14:38:05,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:38:05,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:38:05,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:38:05,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:38:05,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:38:05,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-03-03 14:38:07,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9e2fb21/c88773d435054200b55028d3fef0e713/FLAGd6f59da33 [2025-03-03 14:38:07,311 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:38:07,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_6.c [2025-03-03 14:38:07,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9e2fb21/c88773d435054200b55028d3fef0e713/FLAGd6f59da33 [2025-03-03 14:38:07,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9e2fb21/c88773d435054200b55028d3fef0e713 [2025-03-03 14:38:07,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:38:07,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:38:07,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:07,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:38:07,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:38:07,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:07" (1/1) ... [2025-03-03 14:38:07,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137ce0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:07, skipping insertion in model container [2025-03-03 14:38:07,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:38:07" (1/1) ... [2025-03-03 14:38:07,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:38:07,792 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_6.c[2667,2680] [2025-03-03 14:38:07,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:07,802 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:38:07,820 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_6.c[2667,2680] [2025-03-03 14:38:07,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:38:07,833 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:38:07,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:07 WrapperNode [2025-03-03 14:38:07,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:38:07,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:07,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:38:07,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:38:07,839 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:07" (1/1) ... [2025-03-03 14:38:07,845 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:07" (1/1) ... [2025-03-03 14:38:07,859 INFO L138 Inliner]: procedures = 15, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2025-03-03 14:38:07,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:38:07,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:38:07,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:38:07,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:38:07,866 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:07" (1/1) ... [2025-03-03 14:38:07,866 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:07" (1/1) ... [2025-03-03 14:38:07,868 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:07" (1/1) ... [2025-03-03 14:38:07,888 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:07,888 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:07" (1/1) ... [2025-03-03 14:38:07,888 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:07" (1/1) ... [2025-03-03 14:38:07,894 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:07" (1/1) ... [2025-03-03 14:38:07,895 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:07" (1/1) ... [2025-03-03 14:38:07,896 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:07" (1/1) ... [2025-03-03 14:38:07,897 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:07" (1/1) ... [2025-03-03 14:38:07,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:38:07,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:38:07,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:38:07,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:38:07,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:07" (1/1) ... [2025-03-03 14:38:07,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:38:07,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:07,929 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:07,933 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:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:38:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_28_to_28_0 [2025-03-03 14:38:07,948 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_28_to_28_0 [2025-03-03 14:38:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:38:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:38:07,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 14:38:07,949 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2025-03-03 14:38:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2025-03-03 14:38:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_28_0 [2025-03-03 14:38:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_28_0 [2025-03-03 14:38:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:38:07,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:38:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:38:07,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:38:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:38:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 14:38:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 14:38:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2025-03-03 14:38:07,951 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2025-03-03 14:38:07,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:38:08,018 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:38:08,019 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:38:08,138 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: 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;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset;call ULTIMATE.dealloc(main_~#f~0#1.base, main_~#f~0#1.offset);havoc main_~#f~0#1.base, main_~#f~0#1.offset; [2025-03-03 14:38:08,167 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 14:38:08,167 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:38:08,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:38:08,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:38:08,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:08 BoogieIcfgContainer [2025-03-03 14:38:08,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:38:08,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:38:08,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:38:08,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:38:08,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:38:07" (1/3) ... [2025-03-03 14:38:08,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef0e838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:08, skipping insertion in model container [2025-03-03 14:38:08,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:38:07" (2/3) ... [2025-03-03 14:38:08,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ef0e838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:38:08, skipping insertion in model container [2025-03-03 14:38:08,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:38:08" (3/3) ... [2025-03-03 14:38:08,182 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_6.c [2025-03-03 14:38:08,192 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:38:08,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_6.c that has 5 procedures, 46 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 14:38:08,230 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:38:08,240 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;@32d7ba18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:38:08,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:38:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 32 states have (on average 1.375) internal successors, (44), 37 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 14:38:08,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash 978872887, now seen corresponding path program 1 times [2025-03-03 14:38:08,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323836407] [2025-03-03 14:38:08,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 14:38:08,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 14:38:08,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,445 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:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323836407] [2025-03-03 14:38:08,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323836407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:38:08,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844568423] [2025-03-03 14:38:08,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:38:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:38:08,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:38:08,467 INFO L87 Difference]: Start difference. First operand has 46 states, 32 states have (on average 1.375) internal successors, (44), 37 states have internal predecessors, (44), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,501 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2025-03-03 14:38:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:38:08,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-03 14:38:08,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,508 INFO L225 Difference]: With dead ends: 64 [2025-03-03 14:38:08,508 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:38:08,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:38:08,514 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:38:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-03 14:38:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 56 transitions. [2025-03-03 14:38:08,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 56 transitions. Word has length 12 [2025-03-03 14:38:08,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,547 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 56 transitions. [2025-03-03 14:38:08,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:08,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2025-03-03 14:38:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 14:38:08,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:38:08,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1616352403, now seen corresponding path program 1 times [2025-03-03 14:38:08,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604195305] [2025-03-03 14:38:08,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 14:38:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 14:38:08,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604195305] [2025-03-03 14:38:08,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604195305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:08,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:38:08,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:38:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977818941] [2025-03-03 14:38:08,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:38:08,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:38:08,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:38:08,657 INFO L87 Difference]: Start difference. First operand 43 states and 56 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,680 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2025-03-03 14:38:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:38:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 14:38:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,682 INFO L225 Difference]: With dead ends: 86 [2025-03-03 14:38:08,682 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:38:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:38:08,684 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:38:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-03 14:38:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:38:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2025-03-03 14:38:08,693 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 14 [2025-03-03 14:38:08,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,693 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2025-03-03 14:38:08,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:38:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2025-03-03 14:38:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 14:38:08,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:08,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:38:08,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,696 INFO L85 PathProgramCache]: Analyzing trace with hash -61201908, now seen corresponding path program 1 times [2025-03-03 14:38:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-03 14:38:08,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:38:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:38:08,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930390953] [2025-03-03 14:38:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930390953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168213108] [2025-03-03 14:38:08,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:08,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:08,796 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:08,798 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:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 14:38:08,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 14:38:08,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:08,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:08,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:38:08,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:08,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:38:08,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168213108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:08,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:08,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:38:08,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958849674] [2025-03-03 14:38:08,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:08,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:38:08,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:08,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:38:08,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:08,943 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,994 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2025-03-03 14:38:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:08,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2025-03-03 14:38:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,995 INFO L225 Difference]: With dead ends: 94 [2025-03-03 14:38:08,995 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 14:38:08,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:38:08,999 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 293 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 14:38:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 14:38:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 14:38:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2025-03-03 14:38:09,005 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 21 [2025-03-03 14:38:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:09,005 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2025-03-03 14:38:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:38:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2025-03-03 14:38:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-03 14:38:09,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:09,006 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:09,014 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,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:09,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1305020333, now seen corresponding path program 2 times [2025-03-03 14:38:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533084619] [2025-03-03 14:38:09,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:09,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 14:38:09,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 14:38:09,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:09,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,566 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:38:09,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533084619] [2025-03-03 14:38:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533084619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487509481] [2025-03-03 14:38:09,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:09,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:09,570 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,571 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,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-03 14:38:09,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-03 14:38:09,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:09,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:38:09,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:38:09,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:38:09,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487509481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:09,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:09,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-03 14:38:09,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789838571] [2025-03-03 14:38:09,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:09,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:38:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:09,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:38:09,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:38:09,844 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 14:38:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:10,083 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2025-03-03 14:38:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:38:10,084 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 42 [2025-03-03 14:38:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:10,086 INFO L225 Difference]: With dead ends: 111 [2025-03-03 14:38:10,088 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 14:38:10,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:38:10,089 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:10,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 131 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 14:38:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 14:38:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 13 states have call successors, (13), 4 states have call predecessors, (13), 5 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-03-03 14:38:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-03-03 14:38:10,101 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 42 [2025-03-03 14:38:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:10,101 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-03-03 14:38:10,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 14:38:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-03-03 14:38:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:38:10,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:10,103 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:10,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:38:10,308 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,SelfDestructingSolverStorable3 [2025-03-03 14:38:10,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1553464477, now seen corresponding path program 1 times [2025-03-03 14:38:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508009837] [2025-03-03 14:38:10,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:10,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:38:10,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:38:10,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:10,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 55 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-03 14:38:10,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508009837] [2025-03-03 14:38:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508009837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:10,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046519139] [2025-03-03 14:38:10,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:10,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:10,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:10,675 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:10,676 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:10,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:38:10,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:38:10,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:10,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:10,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:38:10,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 14:38:10,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-03 14:38:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046519139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:11,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2025-03-03 14:38:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837671838] [2025-03-03 14:38:11,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:38:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:38:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:38:11,072 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:38:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:11,208 INFO L93 Difference]: Finished difference Result 181 states and 267 transitions. [2025-03-03 14:38:11,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:38:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 122 [2025-03-03 14:38:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:11,210 INFO L225 Difference]: With dead ends: 181 [2025-03-03 14:38:11,210 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 14:38:11,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:38:11,211 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:11,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 186 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:11,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 14:38:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-03 14:38:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 89 states have internal predecessors, (98), 31 states have call successors, (31), 4 states have call predecessors, (31), 6 states have return successors, (33), 31 states have call predecessors, (33), 31 states have call successors, (33) [2025-03-03 14:38:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 162 transitions. [2025-03-03 14:38:11,227 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 162 transitions. Word has length 122 [2025-03-03 14:38:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:11,227 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 162 transitions. [2025-03-03 14:38:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-03 14:38:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 162 transitions. [2025-03-03 14:38:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2025-03-03 14:38:11,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:11,244 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 48, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:11,251 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:11,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:11,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:11,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:11,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913063, now seen corresponding path program 1 times [2025-03-03 14:38:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096779133] [2025-03-03 14:38:11,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:11,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-03-03 14:38:11,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-03-03 14:38:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 58 proven. 391 refuted. 0 times theorem prover too weak. 12275 trivial. 0 not checked. [2025-03-03 14:38:12,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:12,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096779133] [2025-03-03 14:38:12,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096779133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652213142] [2025-03-03 14:38:12,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:12,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:12,864 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:12,865 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:13,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-03-03 14:38:13,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-03-03 14:38:13,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:13,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:13,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 5114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:38:13,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 11988 trivial. 0 not checked. [2025-03-03 14:38:13,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 12724 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 11988 trivial. 0 not checked. [2025-03-03 14:38:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652213142] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:14,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:14,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-03 14:38:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113672811] [2025-03-03 14:38:14,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:14,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:38:14,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:14,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:38:14,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:38:14,523 INFO L87 Difference]: Start difference. First operand 123 states and 162 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 14:38:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:14,657 INFO L93 Difference]: Finished difference Result 283 states and 416 transitions. [2025-03-03 14:38:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:14,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 716 [2025-03-03 14:38:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:14,659 INFO L225 Difference]: With dead ends: 283 [2025-03-03 14:38:14,659 INFO L226 Difference]: Without dead ends: 165 [2025-03-03 14:38:14,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1437 GetRequests, 1422 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:38:14,660 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:14,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 195 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-03 14:38:14,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-03 14:38:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.131578947368421) internal successors, (129), 118 states have internal predecessors, (129), 43 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-03-03 14:38:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2025-03-03 14:38:14,687 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 716 [2025-03-03 14:38:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:14,687 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2025-03-03 14:38:14,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 8 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2025-03-03 14:38:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2025-03-03 14:38:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1465 [2025-03-03 14:38:14,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:14,721 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:14,736 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:14,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:14,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:14,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1298341951, now seen corresponding path program 1 times [2025-03-03 14:38:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:14,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112832853] [2025-03-03 14:38:14,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:15,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-03-03 14:38:15,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-03-03 14:38:15,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:15,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 41004 backedges. 88 proven. 805 refuted. 0 times theorem prover too weak. 40111 trivial. 0 not checked. [2025-03-03 14:38:17,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112832853] [2025-03-03 14:38:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112832853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:17,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160225033] [2025-03-03 14:38:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:17,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:17,684 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,686 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:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1464 statements into 1 equivalence classes. [2025-03-03 14:38:18,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1464 of 1464 statements. [2025-03-03 14:38:18,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:18,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 9350 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:38:18,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:18,987 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:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 41004 backedges. 12118 proven. 0 refuted. 0 times theorem prover too weak. 28886 trivial. 0 not checked. [2025-03-03 14:38:19,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:38:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160225033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:38:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:38:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-03-03 14:38:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515851465] [2025-03-03 14:38:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:38:19,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:38:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:19,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:38:19,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:38:19,059 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:38:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:19,116 INFO L93 Difference]: Finished difference Result 327 states and 474 transitions. [2025-03-03 14:38:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:38:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 1464 [2025-03-03 14:38:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:19,118 INFO L225 Difference]: With dead ends: 327 [2025-03-03 14:38:19,118 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 14:38:19,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1469 GetRequests, 1462 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:38:19,119 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:19,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:38:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 14:38:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-03-03 14:38:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.1304347826086956) internal successors, (130), 119 states have internal predecessors, (130), 43 states have call successors, (43), 4 states have call predecessors, (43), 8 states have return successors, (47), 43 states have call predecessors, (47), 43 states have call successors, (47) [2025-03-03 14:38:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 220 transitions. [2025-03-03 14:38:19,138 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 220 transitions. Word has length 1464 [2025-03-03 14:38:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:19,139 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 220 transitions. [2025-03-03 14:38:19,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:38:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 220 transitions. [2025-03-03 14:38:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2025-03-03 14:38:19,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:19,162 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:19,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:38:19,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:19,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:19,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:19,364 INFO L85 PathProgramCache]: Analyzing trace with hash 457378719, now seen corresponding path program 1 times [2025-03-03 14:38:19,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:19,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513687340] [2025-03-03 14:38:19,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:19,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-03-03 14:38:19,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-03-03 14:38:19,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:19,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 49338 backedges. 231 proven. 1227 refuted. 0 times theorem prover too weak. 47880 trivial. 0 not checked. [2025-03-03 14:38:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513687340] [2025-03-03 14:38:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513687340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101780352] [2025-03-03 14:38:23,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:23,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:23,830 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:23,832 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:24,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1644 statements into 1 equivalence classes. [2025-03-03 14:38:25,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1644 of 1644 statements. [2025-03-03 14:38:25,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:25,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:25,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 10034 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 14:38:25,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:25,183 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:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 49338 backedges. 2672 proven. 3 refuted. 0 times theorem prover too weak. 46663 trivial. 0 not checked. [2025-03-03 14:38:25,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49338 backedges. 82 proven. 669 refuted. 0 times theorem prover too weak. 48587 trivial. 0 not checked. [2025-03-03 14:38:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101780352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:27,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:27,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-03 14:38:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513241136] [2025-03-03 14:38:27,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:27,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:38:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:27,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:38:27,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:38:27,348 INFO L87 Difference]: Start difference. First operand 167 states and 220 transitions. Second operand has 25 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:38:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:27,724 INFO L93 Difference]: Finished difference Result 342 states and 527 transitions. [2025-03-03 14:38:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:38:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) Word has length 1644 [2025-03-03 14:38:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:27,728 INFO L225 Difference]: With dead ends: 342 [2025-03-03 14:38:27,728 INFO L226 Difference]: Without dead ends: 180 [2025-03-03 14:38:27,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3306 GetRequests, 3273 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:38:27,731 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 74 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:27,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 406 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:27,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-03-03 14:38:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2025-03-03 14:38:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 117 states have (on average 1.1282051282051282) internal successors, (132), 121 states have internal predecessors, (132), 43 states have call successors, (43), 4 states have call predecessors, (43), 10 states have return successors, (49), 45 states have call predecessors, (49), 43 states have call successors, (49) [2025-03-03 14:38:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 224 transitions. [2025-03-03 14:38:27,742 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 224 transitions. Word has length 1644 [2025-03-03 14:38:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:27,743 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 224 transitions. [2025-03-03 14:38:27,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 4.315789473684211) internal successors, (82), 21 states have internal predecessors, (82), 10 states have call successors, (28), 6 states have call predecessors, (28), 8 states have return successors, (31), 7 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:38:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 224 transitions. [2025-03-03 14:38:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3373 [2025-03-03 14:38:27,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:27,784 INFO L218 NwaCegarLoop]: trace histogram [216, 216, 144, 144, 144, 144, 144, 144, 144, 108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:27,804 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:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:27,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1856508575, now seen corresponding path program 2 times [2025-03-03 14:38:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-03-03 14:38:27,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:28,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3372 statements into 2 equivalence classes. [2025-03-03 14:38:28,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 3372 of 3372 statements. [2025-03-03 14:38:28,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:28,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 233802 backedges. 116 proven. 2383 refuted. 0 times theorem prover too weak. 231303 trivial. 0 not checked. [2025-03-03 14:38:45,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-03-03 14:38:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4487649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:45,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425271986] [2025-03-03 14:38:45,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:45,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:45,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:45,050 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:45,052 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:45,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3372 statements into 2 equivalence classes. [2025-03-03 14:38:47,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 3372 of 3372 statements. [2025-03-03 14:38:47,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:47,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:47,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 19430 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 14:38:47,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:47,668 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:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 233802 backedges. 102114 proven. 3 refuted. 0 times theorem prover too weak. 131685 trivial. 0 not checked. [2025-03-03 14:38:47,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 233802 backedges. 2616 proven. 752 refuted. 0 times theorem prover too weak. 230434 trivial. 0 not checked. [2025-03-03 14:38:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425271986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:52,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 24 [2025-03-03 14:38:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110951228] [2025-03-03 14:38:52,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:38:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:52,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:38:52,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:38:52,687 INFO L87 Difference]: Start difference. First operand 171 states and 224 transitions. Second operand has 24 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 12 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-03 14:38:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:52,891 INFO L93 Difference]: Finished difference Result 341 states and 488 transitions. [2025-03-03 14:38:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:38:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 12 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) Word has length 3372 [2025-03-03 14:38:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:52,893 INFO L225 Difference]: With dead ends: 341 [2025-03-03 14:38:52,893 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 14:38:52,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6759 GetRequests, 6730 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:38:52,894 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:52,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 322 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:52,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 14:38:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2025-03-03 14:38:52,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 119 states have (on average 1.1260504201680672) internal successors, (134), 123 states have internal predecessors, (134), 43 states have call successors, (43), 4 states have call predecessors, (43), 12 states have return successors, (51), 47 states have call predecessors, (51), 43 states have call successors, (51) [2025-03-03 14:38:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 228 transitions. [2025-03-03 14:38:52,906 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 228 transitions. Word has length 3372 [2025-03-03 14:38:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:52,906 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 228 transitions. [2025-03-03 14:38:52,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 12 states have call successors, (30), 5 states have call predecessors, (30), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-03 14:38:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 228 transitions. [2025-03-03 14:38:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6397 [2025-03-03 14:38:53,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:53,103 INFO L218 NwaCegarLoop]: trace histogram [648, 648, 432, 432, 432, 288, 288, 216, 216, 216, 216, 216, 216, 216, 144, 144, 108, 108, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:53,139 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:53,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:53,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:53,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:53,305 INFO L85 PathProgramCache]: Analyzing trace with hash 357345183, now seen corresponding path program 3 times [2025-03-03 14:38:53,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:53,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-03-03 14:38:53,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:53,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6396 statements into 259 equivalence classes. [2025-03-03 14:38:53,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 72 of 6396 statements. [2025-03-03 14:38:53,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:38:53,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1248354 backedges. 1800 proven. 9 refuted. 0 times theorem prover too weak. 1246545 trivial. 0 not checked. [2025-03-03 14:38:53,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-03-03 14:38:53,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562401806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:53,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912564081] [2025-03-03 14:38:53,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:53,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:53,994 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:53,995 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:55,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 6396 statements into 259 equivalence classes. [2025-03-03 14:38:55,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 72 of 6396 statements. [2025-03-03 14:38:55,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 14:38:55,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:55,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 14:38:55,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:55,832 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:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1248354 backedges. 2488 proven. 3 refuted. 0 times theorem prover too weak. 1245863 trivial. 0 not checked. [2025-03-03 14:38:55,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:39:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1248354 backedges. 2068 proven. 4 refuted. 0 times theorem prover too weak. 1246282 trivial. 0 not checked. [2025-03-03 14:39:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912564081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:39:06,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:39:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 10] total 28 [2025-03-03 14:39:06,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330616114] [2025-03-03 14:39:06,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:39:06,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:39:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:39:06,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:39:06,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:39:06,603 INFO L87 Difference]: Start difference. First operand 175 states and 228 transitions. Second operand has 28 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 24 states have internal predecessors, (69), 13 states have call successors, (21), 6 states have call predecessors, (21), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2025-03-03 14:39:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:39:07,030 INFO L93 Difference]: Finished difference Result 349 states and 529 transitions. [2025-03-03 14:39:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:39:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 24 states have internal predecessors, (69), 13 states have call successors, (21), 6 states have call predecessors, (21), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) Word has length 6396 [2025-03-03 14:39:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:39:07,035 INFO L225 Difference]: With dead ends: 349 [2025-03-03 14:39:07,035 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 14:39:07,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12816 GetRequests, 12779 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 14:39:07,037 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:39:07,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 350 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:39:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 14:39:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-03 14:39:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 121 states have (on average 1.1239669421487604) internal successors, (136), 125 states have internal predecessors, (136), 43 states have call successors, (43), 4 states have call predecessors, (43), 14 states have return successors, (53), 49 states have call predecessors, (53), 43 states have call successors, (53) [2025-03-03 14:39:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 232 transitions. [2025-03-03 14:39:07,050 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 232 transitions. Word has length 6396 [2025-03-03 14:39:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:39:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 232 transitions. [2025-03-03 14:39:07,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 24 states have internal predecessors, (69), 13 states have call successors, (21), 6 states have call predecessors, (21), 9 states have return successors, (23), 10 states have call predecessors, (23), 13 states have call successors, (23) [2025-03-03 14:39:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 232 transitions. [2025-03-03 14:39:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17449 [2025-03-03 14:39:08,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:39:08,374 INFO L218 NwaCegarLoop]: trace histogram [1944, 1944, 1296, 1296, 1296, 864, 864, 648, 648, 648, 648, 648, 648, 648, 324, 324, 216, 216, 216, 216, 216, 216, 216, 144, 144, 108, 108, 108, 108, 108, 108, 108, 36, 36, 36, 36, 36, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:39:08,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:39:08,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:39:08,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:39:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:39:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash -456423025, now seen corresponding path program 4 times [2025-03-03 14:39:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:39:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999256581] [2025-03-03 14:39:08,579 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:39:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:39:09,490 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17448 statements into 2 equivalence classes. [2025-03-03 14:39:14,740 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17447 of 17448 statements. [2025-03-03 14:39:14,741 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:39:14,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat