./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:11:03,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:11:03,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:11:03,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:11:03,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:11:03,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:11:03,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:11:03,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:11:03,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:11:03,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:11:03,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:11:03,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:11:03,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:11:03,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:11:03,196 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:11:03,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:11:03,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:11:03,197 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:11:03,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:11:03,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:11:03,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:11:03,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:11:03,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:11:03,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:11:03,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:11:03,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:11:03,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:11:03,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:11:03,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:11:03,203 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:11:03,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:11:03,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:11:03,204 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:11:03,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:11:03,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:11:03,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:11:03,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:11:03,495 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:11:03,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-25 00:11:05,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:11:05,345 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:11:05,345 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-25 00:11:05,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ec91d2914/18eed3e63d454aee9320679465e0f2c9/FLAG86552b244 [2024-09-25 00:11:05,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ec91d2914/18eed3e63d454aee9320679465e0f2c9 [2024-09-25 00:11:05,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:11:05,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:11:05,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:11:05,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:11:05,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:11:05,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587ceadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05, skipping insertion in model container [2024-09-25 00:11:05,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:11:05,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-25 00:11:05,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:11:05,617 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:11:05,630 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-25 00:11:05,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:11:05,716 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:11:05,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05 WrapperNode [2024-09-25 00:11:05,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:11:05,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:11:05,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:11:05,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:11:05,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,740 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:11:05,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:11:05,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:11:05,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:11:05,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:11:05,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,784 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 11, 11, 5, 5, 3]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 0, 0, 1, 1]. The 9 writes are split as follows [0, 3, 3, 1, 1, 1]. [2024-09-25 00:11:05,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:11:05,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:11:05,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:11:05,815 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:11:05,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (1/1) ... [2024-09-25 00:11:05,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:11:05,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:11:05,851 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 00:11:05,854 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 00:11:05,900 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-25 00:11:05,901 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-25 00:11:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:11:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-25 00:11:05,901 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-25 00:11:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:11:05,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:11:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:11:05,901 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:11:05,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-25 00:11:05,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-25 00:11:05,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:11:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-25 00:11:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:11:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-25 00:11:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:11:05,905 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:11:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:11:06,010 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:11:06,012 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:11:06,218 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-25 00:11:06,218 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:11:06,243 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:11:06,243 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:11:06,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:11:06 BoogieIcfgContainer [2024-09-25 00:11:06,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:11:06,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:11:06,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:11:06,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:11:06,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:11:05" (1/3) ... [2024-09-25 00:11:06,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b7c180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:11:06, skipping insertion in model container [2024-09-25 00:11:06,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:11:05" (2/3) ... [2024-09-25 00:11:06,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b7c180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:11:06, skipping insertion in model container [2024-09-25 00:11:06,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:11:06" (3/3) ... [2024-09-25 00:11:06,252 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-25 00:11:06,265 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:11:06,265 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:11:06,314 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:11:06,325 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;@7c6c7c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:11:06,325 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:11:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 00:11:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 00:11:06,344 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:06,345 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:06,345 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:06,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-25 00:11:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721922626] [2024-09-25 00:11:06,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:11:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:11:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:11:06,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721922626] [2024-09-25 00:11:06,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721922626] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:06,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:11:06,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:11:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453368517] [2024-09-25 00:11:06,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:06,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:11:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:06,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:11:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:11:06,711 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:11:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:06,924 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-25 00:11:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:11:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-25 00:11:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:06,954 INFO L225 Difference]: With dead ends: 102 [2024-09-25 00:11:06,958 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 00:11:06,961 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:11:06,968 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:06,969 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:11:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 00:11:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-25 00:11:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:11:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-25 00:11:07,044 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-25 00:11:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:07,047 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-25 00:11:07,048 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:11:07,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-25 00:11:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 00:11:07,050 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:07,050 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:07,050 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:11:07,050 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:07,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-25 00:11:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12245284] [2024-09-25 00:11:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:11:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:11:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:11:07,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12245284] [2024-09-25 00:11:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12245284] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:11:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:11:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066839599] [2024-09-25 00:11:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:07,408 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:11:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:11:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:11:07,412 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:11:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:07,626 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-25 00:11:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:11:07,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-25 00:11:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:07,627 INFO L225 Difference]: With dead ends: 81 [2024-09-25 00:11:07,628 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 00:11:07,628 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:11:07,629 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:07,629 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:11:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 00:11:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 00:11:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-25 00:11:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-25 00:11:07,637 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-25 00:11:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:07,637 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-25 00:11:07,637 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:11:07,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-25 00:11:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:11:07,638 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:07,638 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:07,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:11:07,639 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:07,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-25 00:11:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537435883] [2024-09-25 00:11:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:07,916 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:08,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:08,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:11:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:08,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:11:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:11:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:08,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537435883] [2024-09-25 00:11:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537435883] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:11:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453069046] [2024-09-25 00:11:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:08,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:11:08,178 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 00:11:08,179 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 00:11:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:08,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 00:11:08,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:11:08,328 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 00:11:08,424 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 00:11:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:11:08,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:11:08,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453069046] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:08,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:11:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-09-25 00:11:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741555248] [2024-09-25 00:11:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:08,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 00:11:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 00:11:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:11:08,514 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:11:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:08,686 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2024-09-25 00:11:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:11:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-09-25 00:11:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:08,688 INFO L225 Difference]: With dead ends: 87 [2024-09-25 00:11:08,689 INFO L226 Difference]: Without dead ends: 59 [2024-09-25 00:11:08,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-09-25 00:11:08,690 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:08,691 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 282 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:11:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-25 00:11:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2024-09-25 00:11:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 34 states have internal predecessors, (36), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-25 00:11:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-09-25 00:11:08,706 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 36 [2024-09-25 00:11:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:08,706 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-09-25 00:11:08,707 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:11:08,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-09-25 00:11:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:11:08,708 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:08,708 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:08,723 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:11:08,908 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:08,909 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:08,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:08,910 INFO L85 PathProgramCache]: Analyzing trace with hash -687662150, now seen corresponding path program 1 times [2024-09-25 00:11:08,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:08,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521265114] [2024-09-25 00:11:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:11:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:11:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:11:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521265114] [2024-09-25 00:11:09,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521265114] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:11:09,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870363604] [2024-09-25 00:11:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:09,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:09,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:11:09,337 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 00:11:09,338 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 00:11:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:09,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 00:11:09,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:11:09,424 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 00:11:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:11:09,595 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:11:09,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870363604] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:11:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2024-09-25 00:11:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726651684] [2024-09-25 00:11:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:09,600 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 00:11:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 00:11:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:11:09,601 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:11:09,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:09,918 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-09-25 00:11:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 00:11:09,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-09-25 00:11:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:09,920 INFO L225 Difference]: With dead ends: 65 [2024-09-25 00:11:09,920 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 00:11:09,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:11:09,921 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:09,922 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:11:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 00:11:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2024-09-25 00:11:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 38 states have internal predecessors, (39), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-25 00:11:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2024-09-25 00:11:09,931 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 36 [2024-09-25 00:11:09,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:09,931 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-09-25 00:11:09,931 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:11:09,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:09,932 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2024-09-25 00:11:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 00:11:09,933 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:09,933 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:09,948 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 00:11:10,136 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:10,137 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:10,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash 653020778, now seen corresponding path program 1 times [2024-09-25 00:11:10,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:10,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625513379] [2024-09-25 00:11:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:10,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:11:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:11:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 00:11:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 00:11:10,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:10,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625513379] [2024-09-25 00:11:10,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625513379] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:11:10,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:11:10,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:11:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793806690] [2024-09-25 00:11:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:11:10,302 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:11:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:10,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:11:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:11:10,302 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 00:11:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:11:10,476 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-09-25 00:11:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:11:10,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-25 00:11:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:11:10,478 INFO L225 Difference]: With dead ends: 73 [2024-09-25 00:11:10,478 INFO L226 Difference]: Without dead ends: 57 [2024-09-25 00:11:10,478 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:11:10,479 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:11:10,479 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 29 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:11:10,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-25 00:11:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-25 00:11:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (13), 10 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-25 00:11:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2024-09-25 00:11:10,487 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2024-09-25 00:11:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:11:10,488 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2024-09-25 00:11:10,488 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 00:11:10,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-09-25 00:11:10,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-25 00:11:10,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:11:10,491 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:11:10,491 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 00:11:10,491 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:11:10,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:11:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1480342100, now seen corresponding path program 1 times [2024-09-25 00:11:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:11:10,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987874130] [2024-09-25 00:11:10,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:11:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:11:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:11:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:11:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:11:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:11:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 00:11:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:11:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-25 00:11:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:11:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987874130] [2024-09-25 00:11:10,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987874130] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:11:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558610736] [2024-09-25 00:11:10,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:11:10,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:11:10,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:11:10,994 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 00:11:10,999 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 00:11:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:11:11,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-25 00:11:11,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:11:11,209 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 00:11:11,792 INFO L349 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2024-09-25 00:11:11,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 80 [2024-09-25 00:11:11,993 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 45 treesize of output 29 [2024-09-25 00:11:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 00:11:12,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:11:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 00:11:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558610736] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:11:12,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:11:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2024-09-25 00:11:12,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468040124] [2024-09-25 00:11:12,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:11:12,552 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 00:11:12,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:12,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 00:11:12,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2024-09-25 00:11:12,554 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 30 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 10 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-25 00:11:16,611 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 [0] [2024-09-25 00:11:20,630 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 [0] [2024-09-25 00:11:24,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 00:11:28,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 00:11:32,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 00:11:36,944 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 [0] [2024-09-25 00:11:41,032 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 [0] [2024-09-25 00:11:45,044 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 [0] [2024-09-25 00:11:49,541 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 [0] [2024-09-25 00:11:54,100 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 [0] [2024-09-25 00:11:58,171 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 [0] [2024-09-25 00:12:02,190 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 [0] [2024-09-25 00:12:06,291 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 [0] [2024-09-25 00:12:10,297 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 [0] [2024-09-25 00:12:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:10,338 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2024-09-25 00:12:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-25 00:12:10,338 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 10 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) Word has length 52 [2024-09-25 00:12:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:10,340 INFO L225 Difference]: With dead ends: 130 [2024-09-25 00:12:10,341 INFO L226 Difference]: Without dead ends: 84 [2024-09-25 00:12:10,342 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=376, Invalid=2816, Unknown=0, NotChecked=0, Total=3192 [2024-09-25 00:12:10,344 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 47 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 56.9s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:10,344 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 180 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1008 Invalid, 14 Unknown, 0 Unchecked, 56.9s Time] [2024-09-25 00:12:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-25 00:12:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-09-25 00:12:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 48 states have internal predecessors, (50), 16 states have call successors, (16), 13 states have call predecessors, (16), 11 states have return successors, (15), 11 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-25 00:12:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-09-25 00:12:10,359 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 52 [2024-09-25 00:12:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:10,360 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-09-25 00:12:10,360 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 26 states have internal predecessors, (58), 10 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (15), 5 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-25 00:12:10,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-09-25 00:12:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-25 00:12:10,361 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:10,361 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:10,375 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:12:10,561 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:12:10,562 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:10,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1140779654, now seen corresponding path program 1 times [2024-09-25 00:12:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770218041] [2024-09-25 00:12:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:10,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:10,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-25 00:12:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 00:12:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:12:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-25 00:12:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 00:12:11,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:11,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770218041] [2024-09-25 00:12:11,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770218041] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:11,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485530877] [2024-09-25 00:12:11,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:11,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:11,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:11,215 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 00:12:11,216 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 00:12:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:11,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-25 00:12:11,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-25 00:12:11,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:12:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 00:12:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485530877] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:12:16,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:12:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-09-25 00:12:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539904277] [2024-09-25 00:12:16,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:12:16,207 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 00:12:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:12:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 00:12:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=857, Unknown=1, NotChecked=0, Total=992 [2024-09-25 00:12:16,209 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 32 states, 24 states have (on average 2.125) internal successors, (51), 27 states have internal predecessors, (51), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:12:20,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:36,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:40,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:44,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:48,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:12:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:12:49,137 INFO L93 Difference]: Finished difference Result 149 states and 172 transitions. [2024-09-25 00:12:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 00:12:49,138 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.125) internal successors, (51), 27 states have internal predecessors, (51), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 57 [2024-09-25 00:12:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:12:49,139 INFO L225 Difference]: With dead ends: 149 [2024-09-25 00:12:49,139 INFO L226 Difference]: Without dead ends: 90 [2024-09-25 00:12:49,140 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=333, Invalid=1920, Unknown=3, NotChecked=0, Total=2256 [2024-09-25 00:12:49,140 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 79 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 56 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-09-25 00:12:49,140 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 154 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 773 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-09-25 00:12:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-25 00:12:49,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-09-25 00:12:49,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 54 states have internal predecessors, (57), 17 states have call successors, (17), 14 states have call predecessors, (17), 15 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19) [2024-09-25 00:12:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-09-25 00:12:49,156 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 57 [2024-09-25 00:12:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:12:49,156 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-09-25 00:12:49,156 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.125) internal successors, (51), 27 states have internal predecessors, (51), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:12:49,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-09-25 00:12:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-25 00:12:49,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:12:49,158 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:12:49,175 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 00:12:49,359 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:49,359 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:12:49,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:12:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1505924898, now seen corresponding path program 2 times [2024-09-25 00:12:49,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:12:49,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812058435] [2024-09-25 00:12:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:12:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:12:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:50,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:12:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:50,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:12:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:50,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:51,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:51,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:51,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:51,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:12:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 00:12:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 00:12:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 00:12:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-25 00:12:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:12:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-25 00:12:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:12:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812058435] [2024-09-25 00:12:52,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812058435] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:12:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790900723] [2024-09-25 00:12:52,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:12:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:12:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:12:52,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:12:52,202 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:12:52,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:12:52,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:12:52,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-09-25 00:12:52,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:12:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-09-25 00:12:53,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:13:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 00:13:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790900723] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:13:56,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:13:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 30] total 64 [2024-09-25 00:13:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677112385] [2024-09-25 00:13:56,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:13:56,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-09-25 00:13:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-09-25 00:13:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3643, Unknown=15, NotChecked=0, Total=4032 [2024-09-25 00:13:56,103 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 64 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 55 states have internal predecessors, (79), 18 states have call successors, (28), 11 states have call predecessors, (28), 23 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2024-09-25 00:14:01,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:05,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:09,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-09-25 00:14:13,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:17,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:21,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:25,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:29,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:33,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:37,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:25,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:29,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:33,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:37,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:15:41,567 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 []