./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:30:17,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:30:17,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:30:17,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:30:17,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:30:17,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:30:17,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:30:17,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:30:17,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:30:17,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:30:17,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:30:17,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:30:17,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:30:17,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:30:17,087 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:30:17,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:30:17,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:30:17,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:30:17,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:30:17,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:30:17,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:30:17,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:30:17,092 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:30:17,092 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:30:17,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:30:17,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:30:17,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:30:17,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:30:17,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:30:17,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:30:17,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:30:17,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:30:17,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:30:17,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:30:17,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:30:17,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:30:17,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:30:17,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:30:17,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:30:17,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:30:17,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:30:17,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:30:17,099 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:30:17,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:30:17,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:30:17,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:30:17,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:30:17,380 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:30:17,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-25 11:30:18,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:30:18,862 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:30:18,863 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-25 11:30:18,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fe248531e/9429580dc3104a319d47b051ddd447f7/FLAGc52c143aa [2024-09-25 11:30:18,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fe248531e/9429580dc3104a319d47b051ddd447f7 [2024-09-25 11:30:18,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:30:18,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:30:18,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:30:18,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:30:18,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:30:18,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:30:18" (1/1) ... [2024-09-25 11:30:18,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2894a7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:18, skipping insertion in model container [2024-09-25 11:30:18,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:30:18" (1/1) ... [2024-09-25 11:30:18,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:30:19,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-25 11:30:19,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:30:19,082 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:30:19,098 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-25 11:30:19,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:30:19,126 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:30:19,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19 WrapperNode [2024-09-25 11:30:19,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:30:19,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:30:19,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:30:19,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:30:19,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,148 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:30:19,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:30:19,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:30:19,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:30:19,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:30:19,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,178 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [3, 2, 5, 11, 11, 5]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [1, 2, 0, 0, 0, 1]. The 9 writes are split as follows [1, 0, 1, 3, 3, 1]. [2024-09-25 11:30:19,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:30:19,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:30:19,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:30:19,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:30:19,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (1/1) ... [2024-09-25 11:30:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:30:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:19,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 11:30:19,236 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 11:30:19,271 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-25 11:30:19,271 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-25 11:30:19,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:30:19,272 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-25 11:30:19,272 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-25 11:30:19,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:30:19,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:30:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:30:19,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:30:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:30:19,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:30:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:30:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 11:30:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 11:30:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-25 11:30:19,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:30:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:30:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:30:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:30:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 11:30:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 11:30:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-25 11:30:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:30:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:30:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-25 11:30:19,277 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-25 11:30:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:30:19,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:30:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:30:19,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:30:19,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:30:19,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:30:19,376 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:30:19,378 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:30:19,630 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-25 11:30:19,630 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:30:19,653 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:30:19,653 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:30:19,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:30:19 BoogieIcfgContainer [2024-09-25 11:30:19,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:30:19,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:30:19,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:30:19,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:30:19,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:30:18" (1/3) ... [2024-09-25 11:30:19,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73b6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:30:19, skipping insertion in model container [2024-09-25 11:30:19,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:30:19" (2/3) ... [2024-09-25 11:30:19,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73b6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:30:19, skipping insertion in model container [2024-09-25 11:30:19,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:30:19" (3/3) ... [2024-09-25 11:30:19,659 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-25 11:30:19,675 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:30:19,675 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:30:19,711 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:30:19,716 INFO L336 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=All, 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;@180a509d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:30:19,716 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:30:19,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 11:30:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 11:30:19,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:19,726 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:19,726 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:19,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-25 11:30:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402377331] [2024-09-25 11:30:19,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:19,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:19,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:19,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:30:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:19,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:30:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:30:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402377331] [2024-09-25 11:30:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402377331] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:20,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:30:20,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 11:30:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891068963] [2024-09-25 11:30:20,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:20,010 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 11:30:20,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 11:30:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:30:20,031 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:30:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:20,173 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-25 11:30:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 11:30:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-25 11:30:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:20,182 INFO L225 Difference]: With dead ends: 102 [2024-09-25 11:30:20,182 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 11:30:20,186 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-09-25 11:30:20,189 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:20,190 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 11:30:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-25 11:30:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:30:20,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-25 11:30:20,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-25 11:30:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:20,223 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-25 11:30:20,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:30:20,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-25 11:30:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 11:30:20,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:20,226 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:20,226 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:30:20,226 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:20,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:20,227 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-25 11:30:20,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:20,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72084716] [2024-09-25 11:30:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:30:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:30:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:30:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:20,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72084716] [2024-09-25 11:30:20,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72084716] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:20,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:30:20,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:30:20,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427926047] [2024-09-25 11:30:20,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:20,548 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:30:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:30:20,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:30:20,550 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:30:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:20,751 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-25 11:30:20,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:30:20,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-25 11:30:20,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:20,753 INFO L225 Difference]: With dead ends: 81 [2024-09-25 11:30:20,753 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:30:20,753 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:30:20,754 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:20,755 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:30:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 11:30:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-25 11:30:20,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-25 11:30:20,762 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-25 11:30:20,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:20,762 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-25 11:30:20,762 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 11:30:20,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:20,763 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-25 11:30:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 11:30:20,763 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:20,764 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:20,764 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:30:20,764 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:20,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-25 11:30:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831886164] [2024-09-25 11:30:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:20,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:30:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:30:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 11:30:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:21,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831886164] [2024-09-25 11:30:21,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831886164] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250708909] [2024-09-25 11:30:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:21,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:21,204 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:21,205 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 11:30:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:21,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-25 11:30:21,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:21,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 11:30:21,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:30:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250708909] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:30:22,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:30:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2024-09-25 11:30:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958762632] [2024-09-25 11:30:22,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:30:22,030 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:30:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:30:22,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:30:22,033 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-25 11:30:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:22,725 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-09-25 11:30:22,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:30:22,726 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) Word has length 36 [2024-09-25 11:30:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:22,727 INFO L225 Difference]: With dead ends: 92 [2024-09-25 11:30:22,727 INFO L226 Difference]: Without dead ends: 58 [2024-09-25 11:30:22,728 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 11:30:22,729 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:22,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 11:30:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-25 11:30:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-09-25 11:30:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.15625) internal successors, (37), 35 states have internal predecessors, (37), 14 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (14), 13 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:30:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-09-25 11:30:22,737 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 36 [2024-09-25 11:30:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:22,737 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-09-25 11:30:22,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 8 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-25 11:30:22,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-09-25 11:30:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 11:30:22,739 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:22,739 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:22,752 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:30:22,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:22,941 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:22,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 988938436, now seen corresponding path program 2 times [2024-09-25 11:30:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285171385] [2024-09-25 11:30:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:23,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:23,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:23,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:30:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:30:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 11:30:24,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285171385] [2024-09-25 11:30:24,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285171385] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:24,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573330450] [2024-09-25 11:30:24,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:30:24,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:24,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:24,618 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:24,622 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:30:24,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:30:24,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:30:24,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 11:30:24,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:24,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:30:24,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 11:30:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-09-25 11:30:24,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:30:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573330450] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:24,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:30:24,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2024-09-25 11:30:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911403524] [2024-09-25 11:30:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:24,982 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:30:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:24,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:30:24,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:30:24,983 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 11:30:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:25,147 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-09-25 11:30:25,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 11:30:25,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2024-09-25 11:30:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:25,149 INFO L225 Difference]: With dead ends: 96 [2024-09-25 11:30:25,149 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 11:30:25,149 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:30:25,150 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:25,150 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 309 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:25,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 11:30:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-09-25 11:30:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 14 states have call successors, (14), 9 states have call predecessors, (14), 10 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-25 11:30:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2024-09-25 11:30:25,159 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 51 [2024-09-25 11:30:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:25,160 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2024-09-25 11:30:25,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 5 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 11:30:25,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2024-09-25 11:30:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 11:30:25,161 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:25,161 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:25,174 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:30:25,361 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:25,362 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:25,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:25,362 INFO L85 PathProgramCache]: Analyzing trace with hash 987091394, now seen corresponding path program 1 times [2024-09-25 11:30:25,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:25,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044273645] [2024-09-25 11:30:25,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:25,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:25,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:25,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:30:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:30:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 11:30:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044273645] [2024-09-25 11:30:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044273645] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536665447] [2024-09-25 11:30:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:26,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:26,587 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:30:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:26,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-25 11:30:26,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:26,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:30:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-09-25 11:30:26,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:30:26,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536665447] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:26,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:30:26,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 27 [2024-09-25 11:30:26,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810774985] [2024-09-25 11:30:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:26,916 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:30:26,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:26,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:30:26,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2024-09-25 11:30:26,917 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:30:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:27,083 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2024-09-25 11:30:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 11:30:27,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-09-25 11:30:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:27,085 INFO L225 Difference]: With dead ends: 74 [2024-09-25 11:30:27,085 INFO L226 Difference]: Without dead ends: 72 [2024-09-25 11:30:27,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2024-09-25 11:30:27,086 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:27,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-25 11:30:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-09-25 11:30:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 43 states have internal predecessors, (45), 15 states have call successors, (15), 10 states have call predecessors, (15), 11 states have return successors, (16), 13 states have call predecessors, (16), 12 states have call successors, (16) [2024-09-25 11:30:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2024-09-25 11:30:27,095 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 51 [2024-09-25 11:30:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:27,095 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2024-09-25 11:30:27,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:30:27,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2024-09-25 11:30:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-25 11:30:27,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:27,096 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:27,112 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:30:27,296 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:27,298 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:27,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 982539890, now seen corresponding path program 1 times [2024-09-25 11:30:27,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:27,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046538146] [2024-09-25 11:30:27,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:27,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:27,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:27,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:30:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:30:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 11:30:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-25 11:30:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046538146] [2024-09-25 11:30:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046538146] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259813924] [2024-09-25 11:30:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:28,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:28,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:28,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:28,681 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:30:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:28,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:30:28,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-09-25 11:30:29,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:30:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259813924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:30:29,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:30:29,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 23 [2024-09-25 11:30:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811502280] [2024-09-25 11:30:29,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:30:29,053 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:30:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:30:29,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:30:29,054 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 11:30:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:30:29,204 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2024-09-25 11:30:29,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:30:29,205 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), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-09-25 11:30:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:30:29,206 INFO L225 Difference]: With dead ends: 89 [2024-09-25 11:30:29,206 INFO L226 Difference]: Without dead ends: 73 [2024-09-25 11:30:29,207 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:30:29,207 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:30:29,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:30:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-25 11:30:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-09-25 11:30:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 16 states have call successors, (16), 11 states have call predecessors, (16), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-25 11:30:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-09-25 11:30:29,218 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 57 [2024-09-25 11:30:29,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:30:29,218 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-09-25 11:30:29,218 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 11:30:29,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-09-25 11:30:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-25 11:30:29,219 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:30:29,219 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:30:29,234 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:30:29,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:29,424 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:30:29,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:30:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1891199924, now seen corresponding path program 1 times [2024-09-25 11:30:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:30:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764157553] [2024-09-25 11:30:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:30:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:29,959 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:30:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:29,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:30:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:30:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:30:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 11:30:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 11:30:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-25 11:30:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 11:30:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:30:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764157553] [2024-09-25 11:30:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764157553] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224398528] [2024-09-25 11:30:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:30:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:30:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:30:30,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:30:30,781 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:30:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:30:31,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 11:30:31,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:30:31,323 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 11:30:31,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:57,126 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:30:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224398528] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:30:57,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:30:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 22] total 47 [2024-09-25 11:30:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878086021] [2024-09-25 11:30:57,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:30:57,128 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-25 11:30:57,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:30:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-25 11:30:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1918, Unknown=6, NotChecked=0, Total=2162 [2024-09-25 11:30:57,131 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 47 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 40 states have internal predecessors, (65), 13 states have call successors, (24), 9 states have call predecessors, (24), 17 states have return successors, (24), 14 states have call predecessors, (24), 13 states have call successors, (24) [2024-09-25 11:31:01,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:05,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:13,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:17,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:21,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:49,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:53,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:57,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:01,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:05,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:09,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:13,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:17,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:21,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:26,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:30,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:34,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:38,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:42,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:46,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:50,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:54,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:32:58,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:02,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:06,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:10,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:14,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:18,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:22,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:50,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:54,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:58,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:02,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:06,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:10,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:14,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:18,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:22,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:26,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:30,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:34,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:38,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:42,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:34:46,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []