./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --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_nla-digbench/recursified_lcm2.c -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 d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --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:38:10,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:38:10,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:38:10,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:38:10,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:38:10,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:38:10,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:38:10,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:38:10,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:38:10,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:38:10,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:38:10,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:38:10,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:38:10,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:38:10,830 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:38:10,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:38:10,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:38:10,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:38:10,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:38:10,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:38:10,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:38:10,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:38:10,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:38:10,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:38:10,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:38:10,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:38:10,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:38:10,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:38:10,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:38:10,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:38:10,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:38:10,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:38:10,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:38:10,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:38:10,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:38:10,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:38:10,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:38:10,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:38:10,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:38:10,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:38:10,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:38:10,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:38:10,840 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 -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 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:38:11,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:38:11,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:38:11,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:38:11,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:38:11,176 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:38:11,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-25 11:38:12,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:38:12,882 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:38:12,882 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-25 11:38:12,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/13c729f8f/9732b0dbec924021804113ce55021f8a/FLAG700e1dc42 [2024-09-25 11:38:12,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/13c729f8f/9732b0dbec924021804113ce55021f8a [2024-09-25 11:38:12,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:38:12,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:38:12,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:38:12,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:38:12,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:38:12,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:38:12" (1/1) ... [2024-09-25 11:38:12,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b2b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:12, skipping insertion in model container [2024-09-25 11:38:12,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:38:12" (1/1) ... [2024-09-25 11:38:12,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:38:13,081 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_nla-digbench/recursified_lcm2.c[1061,1074] [2024-09-25 11:38:13,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:38:13,124 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:38:13,136 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_nla-digbench/recursified_lcm2.c[1061,1074] [2024-09-25 11:38:13,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:38:13,179 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:38:13,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13 WrapperNode [2024-09-25 11:38:13,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:38:13,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:38:13,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:38:13,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:38:13,188 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:38:13" (1/1) ... [2024-09-25 11:38:13,200 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:38:13" (1/1) ... [2024-09-25 11:38:13,212 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:38:13,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:38:13,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:38:13,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:38:13,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:38:13,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,252 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 7, 6, 6, 8, 8, 7, 7]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 2, 2, 2, 2, 1, 1]. [2024-09-25 11:38:13,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:38:13,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:38:13,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:38:13,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:38:13,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (1/1) ... [2024-09-25 11:38:13,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:38:13,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:38:13,302 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:38:13,308 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:38:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:38:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:38:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:38:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:38:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 11:38:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:38:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 11:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 11:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-25 11:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-25 11:38:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-25 11:38:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:38:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:38:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:38:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:38:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:38:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:38:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:38:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 11:38:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 11:38:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-25 11:38:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-25 11:38:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-25 11:38:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:38:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:38:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:38:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2024-09-25 11:38:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2024-09-25 11:38:13,504 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:38:13,506 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:38:13,791 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-25 11:38:13,791 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:38:13,816 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:38:13,816 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 11:38:13,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:38:13 BoogieIcfgContainer [2024-09-25 11:38:13,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:38:13,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:38:13,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:38:13,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:38:13,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:38:12" (1/3) ... [2024-09-25 11:38:13,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313a8549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:38:13, skipping insertion in model container [2024-09-25 11:38:13,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:38:13" (2/3) ... [2024-09-25 11:38:13,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313a8549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:38:13, skipping insertion in model container [2024-09-25 11:38:13,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:38:13" (3/3) ... [2024-09-25 11:38:13,827 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2024-09-25 11:38:13,842 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:38:13,842 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:38:13,909 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:38:13,917 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;@df9eca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:38:13,918 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:38:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:38:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 11:38:13,930 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:38:13,930 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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:38:13,931 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:38:13,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1231096965, now seen corresponding path program 1 times [2024-09-25 11:38:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:38:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980596198] [2024-09-25 11:38:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:38:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:38:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:38:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:38:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:38:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:38:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:38:14,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:38:14,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980596198] [2024-09-25 11:38:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980596198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:38:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:38:14,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:38:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16676833] [2024-09-25 11:38:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:38:14,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:38:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:38:14,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:38:14,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:38:14,307 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 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:38:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:38:14,334 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-09-25 11:38:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:38:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 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 36 [2024-09-25 11:38:14,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:38:14,344 INFO L225 Difference]: With dead ends: 72 [2024-09-25 11:38:14,344 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:38:14,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:38:14,352 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:38:14,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:38:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:38:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 11:38:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:38:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-25 11:38:14,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2024-09-25 11:38:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:38:14,391 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-25 11:38:14,391 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 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:38:14,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-25 11:38:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 11:38:14,394 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:38:14,394 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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:38:14,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:38:14,395 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:38:14,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1757352067, now seen corresponding path program 1 times [2024-09-25 11:38:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:38:14,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540616690] [2024-09-25 11:38:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:38:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:38:14,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673732069] [2024-09-25 11:38:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:14,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:38:14,555 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:38:14,557 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:38:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:14,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-09-25 11:38:14,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:38:14,965 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:38:14,970 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:38:14,995 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 11 [2024-09-25 11:38:15,005 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 11 [2024-09-25 11:38:15,016 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 11 [2024-09-25 11:38:15,030 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 11 [2024-09-25 11:38:15,225 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 19 treesize of output 11 [2024-09-25 11:38:15,235 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 19 treesize of output 11 [2024-09-25 11:38:15,241 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 22 treesize of output 10 [2024-09-25 11:38:15,251 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 30 treesize of output 18 [2024-09-25 11:38:15,257 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 19 treesize of output 11 [2024-09-25 11:38:15,262 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 22 treesize of output 10 [2024-09-25 11:38:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:38:15,338 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:38:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:38:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540616690] [2024-09-25 11:38:15,338 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:38:15,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673732069] [2024-09-25 11:38:15,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673732069] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:38:15,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:38:15,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 11:38:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986584494] [2024-09-25 11:38:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:38:15,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:38:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:38:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:38:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:38:15,345 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-25 11:38:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:38:15,631 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-09-25 11:38:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:38:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-09-25 11:38:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:38:15,633 INFO L225 Difference]: With dead ends: 50 [2024-09-25 11:38:15,633 INFO L226 Difference]: Without dead ends: 48 [2024-09-25 11:38:15,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:38:15,635 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:38:15,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 182 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:38:15,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-25 11:38:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-25 11:38:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-25 11:38:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-09-25 11:38:15,648 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 36 [2024-09-25 11:38:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:38:15,649 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-09-25 11:38:15,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-25 11:38:15,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-09-25 11:38:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-25 11:38:15,652 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:38:15,652 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:38:15,662 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 11:38:15,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:15,857 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:38:15,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:15,857 INFO L85 PathProgramCache]: Analyzing trace with hash -641452916, now seen corresponding path program 1 times [2024-09-25 11:38:15,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:38:15,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018306450] [2024-09-25 11:38:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:15,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:38:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:38:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805974798] [2024-09-25 11:38:15,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:15,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:15,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:38:15,947 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:38:15,950 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:38:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:16,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-09-25 11:38:16,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:38:16,457 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:38:16,464 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:38:16,477 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 11 [2024-09-25 11:38:16,483 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 11 [2024-09-25 11:38:16,490 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 11 [2024-09-25 11:38:16,498 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 11 [2024-09-25 11:38:16,527 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 11 treesize of output 7 [2024-09-25 11:38:16,531 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 11 treesize of output 7 [2024-09-25 11:38:16,545 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 11 treesize of output 7 [2024-09-25 11:38:16,551 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 11 treesize of output 7 [2024-09-25 11:38:17,127 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 19 treesize of output 11 [2024-09-25 11:38:17,134 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 19 treesize of output 11 [2024-09-25 11:38:17,140 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 22 treesize of output 10 [2024-09-25 11:38:17,150 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 30 treesize of output 18 [2024-09-25 11:38:17,156 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 19 treesize of output 11 [2024-09-25 11:38:17,160 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 22 treesize of output 10 [2024-09-25 11:38:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:38:17,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:38:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 11:38:19,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:38:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018306450] [2024-09-25 11:38:19,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:38:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805974798] [2024-09-25 11:38:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805974798] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:38:19,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:38:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2024-09-25 11:38:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552093542] [2024-09-25 11:38:19,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:38:19,364 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:38:19,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:38:19,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:38:19,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:38:19,366 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 11:38:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:38:21,306 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-09-25 11:38:21,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:38:21,307 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 46 [2024-09-25 11:38:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:38:21,310 INFO L225 Difference]: With dead ends: 60 [2024-09-25 11:38:21,310 INFO L226 Difference]: Without dead ends: 48 [2024-09-25 11:38:21,311 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:38:21,312 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:38:21,312 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 89 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-25 11:38:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-25 11:38:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-09-25 11:38:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-25 11:38:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-09-25 11:38:21,336 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 46 [2024-09-25 11:38:21,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:38:21,336 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-09-25 11:38:21,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 6 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 11:38:21,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-09-25 11:38:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-25 11:38:21,338 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:38:21,338 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-09-25 11:38:21,347 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:38:21,538 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:21,539 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:38:21,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1100455939, now seen corresponding path program 1 times [2024-09-25 11:38:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:38:21,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74037409] [2024-09-25 11:38:21,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:21,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:38:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:38:21,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719387733] [2024-09-25 11:38:21,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:38:21,627 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:38:21,632 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:38:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:22,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 171 conjuncts are in the unsatisfiable core [2024-09-25 11:38:22,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:38:22,225 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:38:22,226 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:38:22,235 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 11 [2024-09-25 11:38:22,240 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 11 [2024-09-25 11:38:22,246 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 11 [2024-09-25 11:38:22,252 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 11 [2024-09-25 11:38:26,364 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= .cse0 (select (select |c_#memory_int#2| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1)) (= (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1) .cse0)))) (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= .cse1 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1)) (= (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1) .cse1))))) is different from true [2024-09-25 11:38:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 21 [2024-09-25 11:38:26,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 21 [2024-09-25 11:38:26,612 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 42 treesize of output 30 [2024-09-25 11:38:26,620 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 41 treesize of output 29 [2024-09-25 11:38:26,627 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 30 treesize of output 22 [2024-09-25 11:38:26,633 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 44 treesize of output 28 [2024-09-25 11:38:26,639 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 42 treesize of output 26 [2024-09-25 11:38:26,646 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 29 treesize of output 17 [2024-09-25 11:38:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 2 not checked. [2024-09-25 11:38:26,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:38:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 11:38:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:38:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74037409] [2024-09-25 11:38:28,652 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:38:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719387733] [2024-09-25 11:38:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719387733] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:38:28,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:38:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2024-09-25 11:38:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973246777] [2024-09-25 11:38:28,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:38:28,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 11:38:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:38:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 11:38:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-09-25 11:38:28,655 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:38:38,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-25 11:38:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:38:48,825 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2024-09-25 11:38:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 11:38:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2024-09-25 11:38:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:38:48,827 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:38:48,827 INFO L226 Difference]: Without dead ends: 58 [2024-09-25 11:38:48,828 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=4, NotChecked=42, Total=552 [2024-09-25 11:38:48,829 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 40 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-09-25 11:38:48,830 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 209 Invalid, 0 Unknown, 70 Unchecked, 6.4s Time] [2024-09-25 11:38:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-25 11:38:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-09-25 11:38:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 13 states have call successors, (13), 9 states have call predecessors, (13), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-25 11:38:48,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-25 11:38:48,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 47 [2024-09-25 11:38:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:38:48,856 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-25 11:38:48,856 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 8 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 11:38:48,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-25 11:38:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-25 11:38:48,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:38:48,859 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:38:48,868 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:38:49,059 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:49,060 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:38:49,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:38:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1025657766, now seen corresponding path program 1 times [2024-09-25 11:38:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:38:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117220043] [2024-09-25 11:38:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:38:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:38:49,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4790949] [2024-09-25 11:38:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:38:49,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:38:49,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:38:49,231 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:38:49,232 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:38:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:38:50,382 WARN L260 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 261 conjuncts are in the unsatisfiable core [2024-09-25 11:38:50,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:38:50,396 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:38:50,398 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:38:50,404 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 11 [2024-09-25 11:38:50,409 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 11 [2024-09-25 11:38:50,414 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 11 [2024-09-25 11:38:50,420 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 11 [2024-09-25 11:38:50,445 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 11 treesize of output 7 [2024-09-25 11:38:50,448 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 11 treesize of output 7 [2024-09-25 11:38:50,455 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 11 treesize of output 7 [2024-09-25 11:38:50,458 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 11 treesize of output 7 [2024-09-25 11:38:52,324 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 41 treesize of output 37 [2024-09-25 11:38:52,330 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 37 treesize of output 33 [2024-09-25 11:38:52,338 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 33 treesize of output 29 [2024-09-25 11:38:52,343 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 29 treesize of output 25 [2024-09-25 11:39:16,853 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4| Int) (v_arrayElimCell_30 Int) (v_arrayElimCell_29 Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_32 Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4| Int) (v_arrayElimCell_31 Int)) (= (* 2 (mod (* (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_4|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_4|)) 2147483648)) (mod (+ (* v_arrayElimCell_29 v_arrayElimCell_32) (* v_arrayElimCell_30 v_arrayElimCell_31)) 4294967296))) is different from true [2024-09-25 11:39:34,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 60 treesize of output 42 [2024-09-25 11:39:34,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 36 [2024-09-25 11:39:34,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 38 [2024-09-25 11:39:34,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 40 treesize of output 23 [2024-09-25 11:39:35,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:39:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 80 [2024-09-25 11:39:35,785 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 115 treesize of output 91 [2024-09-25 11:39:35,802 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 95 treesize of output 71 [2024-09-25 11:39:35,815 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 98 treesize of output 74 [2024-09-25 11:39:35,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:39:35,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 54 [2024-09-25 11:39:35,858 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:39:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 9 not checked. [2024-09-25 11:39:40,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:39:53,661 WARN L293 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-25 11:40:18,397 WARN L293 SmtUtils]: Spent 15.09s on a formula simplification that was a NOOP. DAG size: 142 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-25 11:40:24,443 WARN L293 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 134 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-25 11:40:30,947 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 173 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-09-25 11:40:38,036 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~v.base|)) (.cse1 (select |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~x.base|))) (let ((.cse5 (select (select |c_old(#memory_int#2)| |c_func_to_recursive_line_35_to_46_0_#in~u.base|) |c_func_to_recursive_line_35_to_46_0_#in~u.offset|)) (.cse2 (select .cse1 |c_func_to_recursive_line_35_to_46_0_#in~x.offset|)) (.cse3 (select (select |c_old(#memory_int#5)| |c_func_to_recursive_line_35_to_46_0_#in~y.base|) |c_func_to_recursive_line_35_to_46_0_#in~y.offset|)) (.cse6 (select .cse4 |c_func_to_recursive_line_35_to_46_0_#in~v.offset|))) (and (forall ((|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8| Int)) (let ((.cse0 (* (mod (* (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8|)) 2147483648) 2))) (or (= (mod (+ (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|))) 4294967296) .cse0) (not (= (mod (+ (* (select (select (store |c_old(#memory_int#4)| |c_func_to_recursive_line_35_to_46_0_#in~x.base| (store .cse1 |c_func_to_recursive_line_35_to_46_0_#in~x.offset| (+ .cse2 (* (- 1) .cse3)))) |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|) (select (select |c_old(#memory_int#2)| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|)) (* (select (select (store |c_old(#memory_int#3)| |c_func_to_recursive_line_35_to_46_0_#in~v.base| (store .cse4 |c_func_to_recursive_line_35_to_46_0_#in~v.offset| (+ .cse5 .cse6))) |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|) (select (select |c_old(#memory_int#5)| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|))) 4294967296) .cse0))))) (or (= (* 2 (mod (* (select (select |c_#memory_int#7| |c_func_to_recursive_line_35_to_46_0_#in~b.base|) |c_func_to_recursive_line_35_to_46_0_#in~b.offset|) (select (select |c_#memory_int#6| |c_func_to_recursive_line_35_to_46_0_#in~a.base|) |c_func_to_recursive_line_35_to_46_0_#in~a.offset|)) 2147483648)) (mod (+ (* .cse5 .cse2) (* .cse3 .cse6)) 4294967296)) (forall ((|v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8| Int) (|v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8| Int)) (= (mod (+ (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_35_to_46_0_#in~u.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~u.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~x.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~x.offset_BEFORE_CALL_8|)) (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~y.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~y.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_35_to_46_0_#in~v.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~v.offset_BEFORE_CALL_8|))) 4294967296) (* (mod (* (select (select |c_#memory_int#6| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_8|) (select (select |c_#memory_int#7| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_8|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_8|)) 2147483648) 2))))))) is different from false [2024-09-25 11:40:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:40:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117220043] [2024-09-25 11:40:52,953 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:40:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4790949] [2024-09-25 11:40:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4790949] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:40:52,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:40:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2024-09-25 11:40:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719536928] [2024-09-25 11:40:52,954 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 11:40:52,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:40:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:40:52,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:40:52,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=660, Unknown=12, NotChecked=106, Total=870 [2024-09-25 11:40:52,955 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 8 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-25 11:40:57,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:01,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:05,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:09,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:14,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:18,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:22,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:26,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:31,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:35,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:39,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:43,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:48,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:52,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:41:56,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:00,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:04,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:09,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:13,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:17,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:21,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:25,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:30,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:34,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:38,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:42,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:46,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:42:50,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]