./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.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 e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 02:12:24,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 02:12:25,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 02:12:25,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 02:12:25,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 02:12:25,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 02:12:25,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 02:12:25,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 02:12:25,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 02:12:25,134 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 02:12:25,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 02:12:25,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 02:12:25,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 02:12:25,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 02:12:25,136 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 02:12:25,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 02:12:25,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 02:12:25,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 02:12:25,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 02:12:25,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 02:12:25,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 02:12:25,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 02:12:25,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 02:12:25,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 02:12:25,143 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 02:12:25,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 02:12:25,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 02:12:25,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 02:12:25,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 02:12:25,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 02:12:25,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 02:12:25,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 02:12:25,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:12:25,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 02:12:25,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 02:12:25,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 02:12:25,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 02:12:25,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 02:12:25,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 02:12:25,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 02:12:25,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 02:12:25,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 02:12:25,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e3035f98bbb3ff84987fa13edbd40518c4756dd57350bdb439e24cd050f366e4 [2024-11-22 02:12:25,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 02:12:25,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 02:12:25,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 02:12:25,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 02:12:25,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 02:12:25,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-22 02:12:26,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 02:12:27,055 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 02:12:27,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-22 02:12:27,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9398487/99971ada7ac74c5e80ead320ec6b8ca6/FLAG8de836675 [2024-11-22 02:12:27,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9398487/99971ada7ac74c5e80ead320ec6b8ca6 [2024-11-22 02:12:27,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 02:12:27,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 02:12:27,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 02:12:27,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 02:12:27,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 02:12:27,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30216a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27, skipping insertion in model container [2024-11-22 02:12:27,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 02:12:27,689 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-11-22 02:12:27,720 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-11-22 02:12:27,726 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-11-22 02:12:27,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:12:27,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 02:12:27,790 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[2334,2347] [2024-11-22 02:12:27,794 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[3766,3779] [2024-11-22 02:12:27,796 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-crafted/recursified_simple_array_index_value_4.i.v+nlh-reducer.c[5247,5260] [2024-11-22 02:12:27,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 02:12:27,820 INFO L204 MainTranslator]: Completed translation [2024-11-22 02:12:27,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27 WrapperNode [2024-11-22 02:12:27,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 02:12:27,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 02:12:27,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 02:12:27,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 02:12:27,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,870 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-22 02:12:27,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 02:12:27,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 02:12:27,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 02:12:27,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 02:12:27,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,902 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 2 writes are split as follows [0, 1, 1]. [2024-11-22 02:12:27,902 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,910 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 02:12:27,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 02:12:27,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 02:12:27,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 02:12:27,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (1/1) ... [2024-11-22 02:12:27,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 02:12:27,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:27,959 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) [2024-11-22 02:12:27,962 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 [2024-11-22 02:12:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 02:12:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 02:12:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 02:12:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 02:12:28,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 02:12:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 02:12:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 02:12:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 02:12:28,013 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_22_0 [2024-11-22 02:12:28,013 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_22_0 [2024-11-22 02:12:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 02:12:28,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 02:12:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 02:12:28,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 02:12:28,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 02:12:28,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 02:12:28,117 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 02:12:28,120 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 02:12:28,400 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 02:12:28,401 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 02:12:28,418 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 02:12:28,420 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 02:12:28,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:28 BoogieIcfgContainer [2024-11-22 02:12:28,421 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 02:12:28,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 02:12:28,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 02:12:28,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 02:12:28,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:12:27" (1/3) ... [2024-11-22 02:12:28,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@910149d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:12:28, skipping insertion in model container [2024-11-22 02:12:28,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:12:27" (2/3) ... [2024-11-22 02:12:28,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@910149d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:12:28, skipping insertion in model container [2024-11-22 02:12:28,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:28" (3/3) ... [2024-11-22 02:12:28,432 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i.v+nlh-reducer.c [2024-11-22 02:12:28,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 02:12:28,452 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 02:12:28,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 02:12:28,516 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;@12a769f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 02:12:28,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-22 02:12:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:12:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 02:12:28,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:28,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:28,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash -595755826, now seen corresponding path program 1 times [2024-11-22 02:12:28,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:28,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589424378] [2024-11-22 02:12:28,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:28,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589424378] [2024-11-22 02:12:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589424378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:29,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 02:12:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539875334] [2024-11-22 02:12:29,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:29,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:12:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:29,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:12:29,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:12:29,176 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 35 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:12:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:29,277 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2024-11-22 02:12:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 02:12:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-22 02:12:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:29,288 INFO L225 Difference]: With dead ends: 70 [2024-11-22 02:12:29,289 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 02:12:29,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 02:12:29,297 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:29,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 218 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 02:12:29,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-22 02:12:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 02:12:29,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-11-22 02:12:29,336 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 15 [2024-11-22 02:12:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:29,336 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-11-22 02:12:29,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 02:12:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-11-22 02:12:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 02:12:29,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:29,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:29,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 02:12:29,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:29,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:29,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1530529050, now seen corresponding path program 1 times [2024-11-22 02:12:29,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:29,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335748212] [2024-11-22 02:12:29,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:29,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:12:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335748212] [2024-11-22 02:12:29,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335748212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:29,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:29,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:12:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999899574] [2024-11-22 02:12:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:29,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:12:29,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:29,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:12:29,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:12:29,544 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:12:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:29,552 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-22 02:12:29,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:12:29,553 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-22 02:12:29,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:29,554 INFO L225 Difference]: With dead ends: 43 [2024-11-22 02:12:29,554 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 02:12:29,554 INFO L431 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 [2024-11-22 02:12:29,556 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:29,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 66 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 02:12:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-22 02:12:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 02:12:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-22 02:12:29,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 20 [2024-11-22 02:12:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:29,562 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-22 02:12:29,563 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 02:12:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-22 02:12:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 02:12:29,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:29,564 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:29,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 02:12:29,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1912367917, now seen corresponding path program 1 times [2024-11-22 02:12:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206118018] [2024-11-22 02:12:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:12:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206118018] [2024-11-22 02:12:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206118018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:12:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326254662] [2024-11-22 02:12:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:12:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:12:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:12:29,627 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:29,669 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2024-11-22 02:12:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:12:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-22 02:12:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:29,672 INFO L225 Difference]: With dead ends: 63 [2024-11-22 02:12:29,672 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 02:12:29,672 INFO L431 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 [2024-11-22 02:12:29,673 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 16 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:29,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 02:12:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-22 02:12:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 02:12:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-22 02:12:29,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2024-11-22 02:12:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:29,682 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-22 02:12:29,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-22 02:12:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 02:12:29,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:29,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 02:12:29,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:29,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1843878408, now seen corresponding path program 1 times [2024-11-22 02:12:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77305393] [2024-11-22 02:12:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:12:29,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:29,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77305393] [2024-11-22 02:12:29,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77305393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:29,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:29,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 02:12:29,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981186878] [2024-11-22 02:12:29,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:29,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 02:12:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 02:12:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 02:12:29,782 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:29,816 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-22 02:12:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 02:12:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-22 02:12:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:29,818 INFO L225 Difference]: With dead ends: 40 [2024-11-22 02:12:29,818 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 02:12:29,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 02:12:29,819 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:29,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 02:12:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 02:12:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 02:12:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-22 02:12:29,832 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-11-22 02:12:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:29,832 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-22 02:12:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-22 02:12:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 02:12:29,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:29,834 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 02:12:29,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1387618200, now seen corresponding path program 1 times [2024-11-22 02:12:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039529643] [2024-11-22 02:12:29,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:29,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:29,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 02:12:29,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039529643] [2024-11-22 02:12:29,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039529643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 02:12:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125550950] [2024-11-22 02:12:29,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 02:12:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 02:12:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 02:12:29,884 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:29,915 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-22 02:12:29,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 02:12:29,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-22 02:12:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:29,916 INFO L225 Difference]: With dead ends: 59 [2024-11-22 02:12:29,917 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 02:12:29,917 INFO L431 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 [2024-11-22 02:12:29,922 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:29,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 02:12:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2024-11-22 02:12:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 02:12:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-22 02:12:29,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2024-11-22 02:12:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:29,931 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-22 02:12:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-22 02:12:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 02:12:29,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:29,932 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 02:12:29,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:29,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1338164728, now seen corresponding path program 1 times [2024-11-22 02:12:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816360474] [2024-11-22 02:12:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:12:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816360474] [2024-11-22 02:12:30,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816360474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:12:30,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637095497] [2024-11-22 02:12:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:30,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:30,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:30,458 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) [2024-11-22 02:12:30,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 02:12:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:30,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 02:12:30,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:12:30,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 02:12:30,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:12:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 02:12:31,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637095497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:12:31,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:12:31,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-11-22 02:12:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800133497] [2024-11-22 02:12:31,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:12:31,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 02:12:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 02:12:31,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2024-11-22 02:12:31,295 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 02:12:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:31,464 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-11-22 02:12:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 02:12:31,465 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2024-11-22 02:12:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:31,465 INFO L225 Difference]: With dead ends: 60 [2024-11-22 02:12:31,465 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 02:12:31,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2024-11-22 02:12:31,467 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:31,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 328 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:12:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 02:12:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 02:12:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 02:12:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-22 02:12:31,473 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 27 [2024-11-22 02:12:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:31,473 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-22 02:12:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 02:12:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-22 02:12:31,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 02:12:31,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:31,474 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:31,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 02:12:31,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-22 02:12:31,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:31,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -392896320, now seen corresponding path program 2 times [2024-11-22 02:12:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:31,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278931859] [2024-11-22 02:12:31,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 02:12:31,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:31,770 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 02:12:31,770 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 02:12:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 02:12:33,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:33,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278931859] [2024-11-22 02:12:33,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278931859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:33,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:33,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 02:12:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885301131] [2024-11-22 02:12:33,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:33,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 02:12:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 02:12:33,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-22 02:12:33,058 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:33,203 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-22 02:12:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 02:12:33,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-22 02:12:33,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:33,204 INFO L225 Difference]: With dead ends: 53 [2024-11-22 02:12:33,204 INFO L226 Difference]: Without dead ends: 38 [2024-11-22 02:12:33,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-22 02:12:33,206 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:33,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 82 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 02:12:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-22 02:12:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-22 02:12:33,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 02:12:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-22 02:12:33,218 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 37 [2024-11-22 02:12:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:33,220 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-22 02:12:33,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-22 02:12:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 02:12:33,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:33,221 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 02:12:33,222 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 23710543, now seen corresponding path program 1 times [2024-11-22 02:12:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653541658] [2024-11-22 02:12:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 02:12:33,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653541658] [2024-11-22 02:12:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653541658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 02:12:33,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 02:12:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 02:12:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143847975] [2024-11-22 02:12:33,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 02:12:33,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 02:12:33,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 02:12:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 02:12:33,334 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:33,364 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-11-22 02:12:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 02:12:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2024-11-22 02:12:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:33,365 INFO L225 Difference]: With dead ends: 38 [2024-11-22 02:12:33,365 INFO L226 Difference]: Without dead ends: 36 [2024-11-22 02:12:33,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 02:12:33,366 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:33,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 02:12:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-22 02:12:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-22 02:12:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 02:12:33,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-22 02:12:33,371 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 38 [2024-11-22 02:12:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-22 02:12:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 02:12:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-22 02:12:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 02:12:33,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 02:12:33,373 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 02:12:33,374 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 02:12:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 02:12:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash 383876377, now seen corresponding path program 1 times [2024-11-22 02:12:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 02:12:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323193865] [2024-11-22 02:12:33,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 02:12:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 02:12:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 02:12:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323193865] [2024-11-22 02:12:34,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323193865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 02:12:34,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627796052] [2024-11-22 02:12:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 02:12:34,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 02:12:34,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 02:12:34,217 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) [2024-11-22 02:12:34,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 02:12:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 02:12:34,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 02:12:34,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 02:12:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 02:12:34,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 02:12:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-22 02:12:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627796052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 02:12:34,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 02:12:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2024-11-22 02:12:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332883454] [2024-11-22 02:12:34,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 02:12:34,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 02:12:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 02:12:34,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 02:12:34,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-22 02:12:34,598 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 17 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 02:12:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 02:12:34,949 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-22 02:12:34,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 02:12:34,950 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2024-11-22 02:12:34,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 02:12:34,951 INFO L225 Difference]: With dead ends: 59 [2024-11-22 02:12:34,951 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 02:12:34,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2024-11-22 02:12:34,952 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 02:12:34,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 162 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 02:12:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 02:12:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 02:12:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2024-11-22 02:12:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 02:12:34,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-11-22 02:12:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 02:12:34,953 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 02:12:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 02:12:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 02:12:34,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 02:12:34,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-11-22 02:12:34,958 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-22 02:12:34,959 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-22 02:12:34,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 02:12:35,162 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,SelfDestructingSolverStorable8 [2024-11-22 02:12:35,165 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 02:12:35,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 02:12:35,192 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 02:12:35,198 WARN L156 FloydHoareUtils]: Requires clause for func_to_recursive_line_20_to_22_0 contained old-variable. Original clause: (= |#memory_int#2| |old(#memory_int#2)|) Eliminated clause: true [2024-11-22 02:12:35,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:12:35 BoogieIcfgContainer [2024-11-22 02:12:35,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 02:12:35,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 02:12:35,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 02:12:35,207 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 02:12:35,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:12:28" (3/4) ... [2024-11-22 02:12:35,210 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 02:12:35,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_22_0 [2024-11-22 02:12:35,218 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-22 02:12:35,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 02:12:35,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 02:12:35,219 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 02:12:35,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 02:12:35,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 02:12:35,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 02:12:35,308 INFO L158 Benchmark]: Toolchain (without parser) took 7853.01ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 98.1MB in the beginning and 164.1MB in the end (delta: -65.9MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,308 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 02:12:35,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.25ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 136.4MB in the end (delta: -38.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.23ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 134.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,310 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,310 INFO L158 Benchmark]: RCFGBuilder took 499.71ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 115.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,310 INFO L158 Benchmark]: TraceAbstraction took 6782.87ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 114.8MB in the beginning and 169.3MB in the end (delta: -54.5MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,310 INFO L158 Benchmark]: Witness Printer took 100.44ms. Allocated memory is still 251.7MB. Free memory was 169.3MB in the beginning and 164.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 02:12:35,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 68.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.25ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 136.4MB in the end (delta: -38.4MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.23ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 134.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.43ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 132.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.71ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 115.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6782.87ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 114.8MB in the beginning and 169.3MB in the end (delta: -54.5MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * Witness Printer took 100.44ms. Allocated memory is still 251.7MB. Free memory was 169.3MB in the beginning and 164.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 125]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 170]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 1197 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 903 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 294 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 306 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 2507 SizeOfPredicates, 7 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 142/169 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - ProcedureContractResult [Line: 36]: Procedure Contract for func_to_recursive_line_20_to_22_0 Derived contract for procedure func_to_recursive_line_20_to_22_0. Ensures: (((__return_main == \old(__return_main)) && (__tmp_155_0 == \old(__tmp_155_0))) && (__return_136 == \old(__return_136))) RESULT: Ultimate proved your program to be correct! [2024-11-22 02:12:35,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE