./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:14:50,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:14:50,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:14:50,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:14:50,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:14:50,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:14:50,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:14:50,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:14:50,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:14:50,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:14:50,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:14:50,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:14:50,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:14:50,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:14:50,704 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:14:50,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:14:50,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:14:50,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:14:50,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:14:50,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:14:50,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:14:50,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:14:50,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:14:50,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:14:50,707 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:14:50,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:14:50,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:14:50,708 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:14:50,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:14:50,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:14:50,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:14:50,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:14:50,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:50,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:14:50,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:14:50,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:14:50,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:14:50,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:14:50,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:14:50,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:14:50,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:14:50,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:14:50,715 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 -> affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:14:50,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:14:51,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:14:51,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:14:51,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:14:51,015 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:14:51,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2024-10-15 15:14:52,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:14:52,630 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:14:52,631 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2024-10-15 15:14:52,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/712d24c47/7558635c684143ca83789158e31cd2f8/FLAG88623a5bf [2024-10-15 15:14:52,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/712d24c47/7558635c684143ca83789158e31cd2f8 [2024-10-15 15:14:52,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:14:52,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:14:52,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:52,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:14:52,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:14:52,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed0d418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52, skipping insertion in model container [2024-10-15 15:14:52,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:14:52,872 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2024-10-15 15:14:52,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:52,902 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:14:52,915 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i[1692,1705] [2024-10-15 15:14:52,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:52,949 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:14:52,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52 WrapperNode [2024-10-15 15:14:52,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:52,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:52,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:14:52,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:14:52,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,974 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:14:52,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:52,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:14:52,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:14:52,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:14:52,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:52,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,015 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 13, 3]. 72 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 5 writes are split as follows [0, 4, 1]. [2024-10-15 15:14:53,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,028 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:14:53,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:14:53,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:14:53,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:14:53,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (1/1) ... [2024-10-15 15:14:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:53,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:53,069 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-10-15 15:14:53,076 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-10-15 15:14:53,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_33_0 [2024-10-15 15:14:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_33_0 [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:14:53,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 15:14:53,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 15:14:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 15:14:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:14:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:14:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:14:53,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:14:53,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:14:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:14:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 15:14:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:14:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:14:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:14:53,194 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_36_to_40_0 [2024-10-15 15:14:53,194 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_36_to_40_0 [2024-10-15 15:14:53,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:14:53,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:14:53,418 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-15 15:14:53,419 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:14:53,438 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:14:53,439 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:14:53,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:53 BoogieIcfgContainer [2024-10-15 15:14:53,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:14:53,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:14:53,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:14:53,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:14:53,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:14:52" (1/3) ... [2024-10-15 15:14:53,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b832898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:53, skipping insertion in model container [2024-10-15 15:14:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:52" (2/3) ... [2024-10-15 15:14:53,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b832898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:53, skipping insertion in model container [2024-10-15 15:14:53,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:53" (3/3) ... [2024-10-15 15:14:53,447 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_1-1.i [2024-10-15 15:14:53,461 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:14:53,461 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:14:53,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:14:53,512 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@4054d879, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:14:53,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:14:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-15 15:14:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 15:14:53,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:53,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:53,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -919097502, now seen corresponding path program 1 times [2024-10-15 15:14:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:53,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994502155] [2024-10-15 15:14:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:54,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994502155] [2024-10-15 15:14:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994502155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:54,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 15:14:54,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948010273] [2024-10-15 15:14:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:54,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 15:14:54,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 15:14:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:14:54,246 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:14:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:54,494 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-10-15 15:14:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:14:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-15 15:14:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:54,506 INFO L225 Difference]: With dead ends: 62 [2024-10-15 15:14:54,507 INFO L226 Difference]: Without dead ends: 30 [2024-10-15 15:14:54,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-15 15:14:54,512 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:54,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:14:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-15 15:14:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-15 15:14:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-10-15 15:14:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-10-15 15:14:54,548 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2024-10-15 15:14:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-10-15 15:14:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 15:14:54,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-10-15 15:14:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-15 15:14:54,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:54,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:14:54,551 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash 614925112, now seen corresponding path program 1 times [2024-10-15 15:14:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297394922] [2024-10-15 15:14:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:14:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:14:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297394922] [2024-10-15 15:14:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297394922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925941066] [2024-10-15 15:14:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:55,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:55,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:55,249 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-10-15 15:14:55,251 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:14:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:55,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-15 15:14:55,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:55,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 15:14:55,499 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 83 treesize of output 70 [2024-10-15 15:14:55,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 23 [2024-10-15 15:14:55,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 24 [2024-10-15 15:14:55,725 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 7 treesize of output 3 [2024-10-15 15:14:55,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 15:14:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:55,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:56,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 15:14:56,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 88 [2024-10-15 15:14:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 46 [2024-10-15 15:14:56,725 INFO L349 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2024-10-15 15:14:56,726 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 44 treesize of output 35 [2024-10-15 15:14:57,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-15 15:14:57,020 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 98 treesize of output 100 [2024-10-15 15:14:57,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 5 [2024-10-15 15:14:57,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 50 treesize of output 48 [2024-10-15 15:14:57,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46 treesize of output 44 [2024-10-15 15:14:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925941066] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:14:57,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:14:57,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 32 [2024-10-15 15:14:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713386415] [2024-10-15 15:14:57,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-15 15:14:57,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:57,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 15:14:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2024-10-15 15:14:57,289 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-15 15:14:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:58,306 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-10-15 15:14:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-15 15:14:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 24 [2024-10-15 15:14:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:58,311 INFO L225 Difference]: With dead ends: 56 [2024-10-15 15:14:58,311 INFO L226 Difference]: Without dead ends: 37 [2024-10-15 15:14:58,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 15:14:58,314 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:58,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 87 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-15 15:14:58,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-15 15:14:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-15 15:14:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-15 15:14:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-15 15:14:58,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2024-10-15 15:14:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:58,327 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-15 15:14:58,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-15 15:14:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-15 15:14:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-15 15:14:58,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:58,328 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:58,346 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:14:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:58,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:58,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1894741686, now seen corresponding path program 2 times [2024-10-15 15:14:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:58,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785755483] [2024-10-15 15:14:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:58,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:14:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:59,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:14:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:59,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:14:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 15:14:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785755483] [2024-10-15 15:14:59,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785755483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:59,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087438992] [2024-10-15 15:14:59,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:14:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:59,447 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-10-15 15:14:59,449 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:14:59,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:14:59,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:14:59,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-15 15:14:59,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:59,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 15:14:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 15:14:59,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:15:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:15:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087438992] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:15:04,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:15:04,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 31 [2024-10-15 15:15:04,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909749806] [2024-10-15 15:15:04,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:15:04,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-15 15:15:04,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:15:04,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-15 15:15:04,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=799, Unknown=1, NotChecked=0, Total=930 [2024-10-15 15:15:04,643 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 31 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 9 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-15 15:15:13,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:17,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:29,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:33,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:37,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:41,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:15:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:15:41,750 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2024-10-15 15:15:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-15 15:15:41,751 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 9 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Word has length 29 [2024-10-15 15:15:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:15:41,752 INFO L225 Difference]: With dead ends: 73 [2024-10-15 15:15:41,752 INFO L226 Difference]: Without dead ends: 52 [2024-10-15 15:15:41,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=326, Invalid=1832, Unknown=4, NotChecked=0, Total=2162 [2024-10-15 15:15:41,754 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 46 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-10-15 15:15:41,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 54 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 469 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-10-15 15:15:41,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-15 15:15:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-10-15 15:15:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (11), 10 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-15 15:15:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-10-15 15:15:41,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 29 [2024-10-15 15:15:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:15:41,773 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-10-15 15:15:41,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 9 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-15 15:15:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-10-15 15:15:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 15:15:41,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:15:41,778 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:15:41,795 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 15:15:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:15:41,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:15:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:15:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -735784678, now seen corresponding path program 3 times [2024-10-15 15:15:41,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:15:41,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991104985] [2024-10-15 15:15:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:15:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:15:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:42,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:15:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:15:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:44,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:15:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:15:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-15 15:15:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:15:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991104985] [2024-10-15 15:15:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991104985] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:15:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417199225] [2024-10-15 15:15:45,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:15:45,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:15:45,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:15:45,616 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-10-15 15:15:45,619 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:15:46,440 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-15 15:15:46,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:15:46,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-15 15:15:46,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:15:46,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-15 15:15:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-15 15:15:47,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:16:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:16:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417199225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:16:50,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:16:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 30] total 64 [2024-10-15 15:16:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986200582] [2024-10-15 15:16:50,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:16:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-15 15:16:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-15 15:16:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3643, Unknown=15, NotChecked=0, Total=4032 [2024-10-15 15:16:50,613 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 64 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 55 states have internal predecessors, (64), 18 states have call successors, (20), 11 states have call predecessors, (20), 22 states have return successors, (22), 20 states have call predecessors, (22), 17 states have call successors, (22) [2024-10-15 15:18:11,039 WARN L286 SmtUtils]: Spent 1.14m on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-15 15:18:16,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:20,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:24,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:28,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:32,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:36,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:40,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:44,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:48,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:18:52,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []