./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/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_3.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 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 03:38:10,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:38:10,367 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 03:38:10,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:38:10,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:38:10,402 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:38:10,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:38:10,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:38:10,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:38:10,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:38:10,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:38:10,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:38:10,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:38:10,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:38:10,407 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:38:10,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:38:10,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:38:10,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:38:10,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 03:38:10,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:38:10,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:38:10,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:38:10,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:38:10,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:38:10,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:38:10,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:38:10,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:38:10,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:38:10,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:38:10,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:38:10,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:38:10,413 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 -> 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 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 [2024-09-13 03:38:10,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:38:10,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:38:10,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:38:10,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:38:10,635 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:38:10,636 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_3.i [2024-09-13 03:38:11,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:38:11,951 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:38:11,951 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2024-09-13 03:38:11,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d4b702c10/731fa779efb24c67a18c1875fb5b1f32/FLAGd7aeacd9a [2024-09-13 03:38:12,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d4b702c10/731fa779efb24c67a18c1875fb5b1f32 [2024-09-13 03:38:12,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:38:12,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:38:12,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:38:12,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:38:12,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:38:12,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45751d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12, skipping insertion in model container [2024-09-13 03:38:12,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:38:12,514 WARN L247 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_3.i[1898,1911] [2024-09-13 03:38:12,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:38:12,548 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:38:12,558 WARN L247 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_3.i[1898,1911] [2024-09-13 03:38:12,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:38:12,583 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:38:12,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12 WrapperNode [2024-09-13 03:38:12,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:38:12,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:38:12,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:38:12,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:38:12,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,604 INFO L138 Inliner]: procedures = 18, calls = 36, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:38:12,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:38:12,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:38:12,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:38:12,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:38:12,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,634 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 12, 4, 3]. 57 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-09-13 03:38:12,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,639 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:38:12,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:38:12,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:38:12,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:38:12,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (1/1) ... [2024-09-13 03:38:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:38:12,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:38:12,669 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-13 03:38:12,671 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-13 03:38:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:38:12,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:38:12,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-13 03:38:12,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:38:12,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2024-09-13 03:38:12,706 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2024-09-13 03:38:12,706 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2024-09-13 03:38:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2024-09-13 03:38:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:38:12,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:38:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-13 03:38:12,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-13 03:38:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-13 03:38:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-13 03:38:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 03:38:12,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 03:38:12,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-13 03:38:12,769 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:38:12,771 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:38:12,921 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-13 03:38:12,921 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:38:12,942 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:38:12,942 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 03:38:12,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:38:12 BoogieIcfgContainer [2024-09-13 03:38:12,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:38:12,944 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:38:12,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:38:12,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:38:12,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:38:12" (1/3) ... [2024-09-13 03:38:12,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de12581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:38:12, skipping insertion in model container [2024-09-13 03:38:12,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:38:12" (2/3) ... [2024-09-13 03:38:12,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de12581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:38:12, skipping insertion in model container [2024-09-13 03:38:12,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:38:12" (3/3) ... [2024-09-13 03:38:12,950 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_3.i [2024-09-13 03:38:12,964 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:38:12,964 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 03:38:13,015 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:38:13,020 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;@9481c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:38:13,021 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 03:38:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:38:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 03:38:13,031 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:38:13,031 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:38:13,032 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:38:13,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1199349225, now seen corresponding path program 1 times [2024-09-13 03:38:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:38:13,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339761808] [2024-09-13 03:38:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:38:13,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:38:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:38:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:38:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 03:38:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:38:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339761808] [2024-09-13 03:38:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339761808] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:38:13,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:38:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 03:38:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949163536] [2024-09-13 03:38:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:38:13,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 03:38:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:38:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 03:38:13,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 03:38:13,451 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 03:38:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:38:13,620 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-09-13 03:38:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 03:38:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-13 03:38:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:38:13,628 INFO L225 Difference]: With dead ends: 60 [2024-09-13 03:38:13,628 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 03:38:13,631 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:38:13,633 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:38:13,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:38:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 03:38:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-09-13 03:38:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 03:38:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 03:38:13,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2024-09-13 03:38:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:38:13,665 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 03:38:13,666 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-13 03:38:13,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 03:38:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 03:38:13,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:38:13,668 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:38:13,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 03:38:13,668 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:38:13,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1197502183, now seen corresponding path program 1 times [2024-09-13 03:38:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:38:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107846023] [2024-09-13 03:38:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:38:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:38:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:38:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:38:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 03:38:13,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:38:13,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107846023] [2024-09-13 03:38:13,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107846023] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:38:13,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:38:13,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 03:38:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658480039] [2024-09-13 03:38:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:38:13,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 03:38:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:38:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 03:38:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 03:38:13,924 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 03:38:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:38:14,043 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-09-13 03:38:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 03:38:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-13 03:38:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:38:14,045 INFO L225 Difference]: With dead ends: 51 [2024-09-13 03:38:14,045 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 03:38:14,046 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:38:14,047 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:38:14,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:38:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 03:38:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 03:38:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 03:38:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-09-13 03:38:14,058 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2024-09-13 03:38:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:38:14,058 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-09-13 03:38:14,058 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 03:38:14,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-09-13 03:38:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 03:38:14,060 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:38:14,060 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:38:14,060 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 03:38:14,060 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:38:14,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1550867151, now seen corresponding path program 1 times [2024-09-13 03:38:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:38:14,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372442323] [2024-09-13 03:38:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:38:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:38:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:14,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:38:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:14,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:38:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:14,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:38:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 03:38:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:38:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372442323] [2024-09-13 03:38:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372442323] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:38:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026747207] [2024-09-13 03:38:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:38:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:38:14,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:38:14,495 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-13 03:38:14,496 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-13 03:38:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:14,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 03:38:14,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:38:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 03:38:14,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:38:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 03:38:15,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026747207] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:38:15,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:38:15,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2024-09-13 03:38:15,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228039480] [2024-09-13 03:38:15,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:38:15,110 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-13 03:38:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:38:15,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-13 03:38:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-09-13 03:38:15,112 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-13 03:38:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:38:15,487 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-09-13 03:38:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:38:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 24 [2024-09-13 03:38:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:38:15,489 INFO L225 Difference]: With dead ends: 62 [2024-09-13 03:38:15,490 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 03:38:15,491 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2024-09-13 03:38:15,491 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:38:15,492 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:38:15,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 03:38:15,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-13 03:38:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 03:38:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-13 03:38:15,506 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2024-09-13 03:38:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:38:15,506 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-13 03:38:15,506 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-13 03:38:15,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-13 03:38:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:38:15,507 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:38:15,507 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:38:15,523 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 03:38:15,708 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-13 03:38:15,709 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:38:15,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:38:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1345242693, now seen corresponding path program 2 times [2024-09-13 03:38:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:38:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022889887] [2024-09-13 03:38:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:38:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:38:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:16,251 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:38:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:16,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:38:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:16,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:38:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:16,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:38:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:17,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:38:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:17,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:38:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:38:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 03:38:17,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:38:17,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022889887] [2024-09-13 03:38:17,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022889887] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:38:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007816700] [2024-09-13 03:38:17,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:38:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:38:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:38:17,203 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-13 03:38:17,205 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-13 03:38:17,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:38:17,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:38:17,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-09-13 03:38:17,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:38:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-13 03:38:17,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:38:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 03:38:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007816700] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:38:43,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:38:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 22] total 48 [2024-09-13 03:38:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002997146] [2024-09-13 03:38:43,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:38:43,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-13 03:38:43,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:38:43,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-13 03:38:43,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2008, Unknown=6, NotChecked=0, Total=2256 [2024-09-13 03:38:43,313 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 41 states have internal predecessors, (50), 14 states have call successors, (16), 9 states have call predecessors, (16), 16 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-13 03:38:47,848 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-13 03:38:51,857 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-13 03:38:55,862 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-13 03:38:59,867 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-13 03:39:03,873 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-13 03:39:07,878 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-13 03:39:35,940 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-13 03:39:39,946 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-13 03:39:44,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:39:48,020 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-13 03:39:52,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:39:56,030 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-13 03:40:00,037 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-13 03:40:04,052 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-13 03:40:08,057 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-13 03:40:12,063 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-13 03:40:16,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:40:20,102 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-13 03:40:24,108 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-13 03:40:28,112 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-13 03:40:32,117 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-13 03:40:36,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:40:40,169 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-13 03:40:44,173 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-13 03:40:48,185 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-13 03:40:52,193 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-13 03:40:56,202 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-13 03:41:00,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:41:04,214 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-13 03:41:08,224 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-13 03:41:36,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:41:40,453 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-13 03:41:44,460 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-13 03:41:48,465 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-13 03:41:52,472 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-13 03:41:56,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:42:00,578 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-13 03:42:04,583 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-13 03:42:08,586 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-13 03:42:12,588 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-13 03:42:16,593 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-13 03:42:20,597 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-13 03:42:24,619 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-13 03:42:28,627 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-13 03:42:32,722 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-13 03:42:48,808 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-13 03:42:52,812 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-13 03:42:56,816 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-13 03:43:00,915 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-13 03:43:04,922 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-13 03:43:08,926 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-13 03:43:12,930 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-13 03:43:16,935 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-13 03:43:20,939 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-13 03:43:24,947 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-13 03:43:28,995 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-13 03:43:33,001 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-13 03:43:37,005 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-13 03:43:41,010 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-13 03:43:45,014 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-13 03:43:49,052 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-13 03:43:53,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:43:57,086 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-13 03:44:01,095 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-13 03:44:05,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 [] [2024-09-13 03:44:09,106 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-13 03:44:13,114 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-13 03:44:17,119 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-13 03:44:21,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:44:25,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:44:29,148 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-13 03:44:33,155 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-13 03:44:37,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:44:41,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-13 03:44:45,205 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-13 03:44:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:44:46,268 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2024-09-13 03:44:46,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-13 03:44:46,268 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 41 states have internal predecessors, (50), 14 states have call successors, (16), 9 states have call predecessors, (16), 16 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 39 [2024-09-13 03:44:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:44:46,270 INFO L225 Difference]: With dead ends: 105 [2024-09-13 03:44:46,270 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 03:44:46,272 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1379 ImplicationChecksByTransitivity, 86.5s TimeCoverageRelationStatistics Valid=846, Invalid=5613, Unknown=21, NotChecked=0, Total=6480 [2024-09-13 03:44:46,273 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 152 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 150 mSolverCounterUnsat, 75 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 300.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 75 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 301.5s IncrementalHoareTripleChecker+Time [2024-09-13 03:44:46,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 117 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 761 Invalid, 75 Unknown, 0 Unchecked, 301.5s Time] [2024-09-13 03:44:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 03:44:46,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2024-09-13 03:44:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 12 states have call successors, (12), 10 states have call predecessors, (12), 14 states have return successors, (15), 13 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-13 03:44:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2024-09-13 03:44:46,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 39 [2024-09-13 03:44:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:44:46,294 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2024-09-13 03:44:46,294 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 41 states have internal predecessors, (50), 14 states have call successors, (16), 9 states have call predecessors, (16), 16 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-13 03:44:46,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:44:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2024-09-13 03:44:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 03:44:46,295 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:44:46,296 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:44:46,310 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 03:44:46,496 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-13 03:44:46,496 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:44:46,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:44:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1499101305, now seen corresponding path program 3 times [2024-09-13 03:44:46,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:44:46,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632956641] [2024-09-13 03:44:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:44:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:44:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:47,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:44:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:47,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:44:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:49,049 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:50,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:50,895 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:51,535 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:52,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:52,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:52,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:52,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:53,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:53,403 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:44:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:44:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-13 03:44:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:44:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632956641] [2024-09-13 03:44:53,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632956641] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:44:53,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909193363] [2024-09-13 03:44:53,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:44:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:44:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:44:53,503 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-13 03:44:53,503 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-13 03:45:01,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-13 03:45:01,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:45:01,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-09-13 03:45:01,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:45:02,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 03:45:02,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-09-13 03:45:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-13 03:45:02,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:47:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 03:47:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909193363] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:47:35,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:47:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 22, 49] total 103 [2024-09-13 03:47:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466417838] [2024-09-13 03:47:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:47:35,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-09-13 03:47:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:47:35,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-09-13 03:47:35,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=9637, Unknown=36, NotChecked=0, Total=10506 [2024-09-13 03:47:35,656 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 103 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 29 states have call successors, (31), 16 states have call predecessors, (31), 34 states have return successors, (34), 32 states have call predecessors, (34), 27 states have call successors, (34) [2024-09-13 03:47:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:47:50,713 INFO L93 Difference]: Finished difference Result 164 states and 275 transitions. [2024-09-13 03:47:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-09-13 03:47:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 29 states have call successors, (31), 16 states have call predecessors, (31), 34 states have return successors, (34), 32 states have call predecessors, (34), 27 states have call successors, (34) Word has length 69 [2024-09-13 03:47:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:47:50,716 INFO L225 Difference]: With dead ends: 164 [2024-09-13 03:47:50,716 INFO L226 Difference]: Without dead ends: 109 [2024-09-13 03:47:50,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5565 ImplicationChecksByTransitivity, 160.1s TimeCoverageRelationStatistics Valid=3391, Invalid=23305, Unknown=36, NotChecked=0, Total=26732 [2024-09-13 03:47:50,722 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 684 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 5155 mSolverCounterSat, 1587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 6742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1587 IncrementalHoareTripleChecker+Valid, 5155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-09-13 03:47:50,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 429 Invalid, 6742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1587 Valid, 5155 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-09-13 03:47:50,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-13 03:47:50,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2024-09-13 03:47:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 64 states have internal predecessors, (75), 19 states have call successors, (19), 17 states have call predecessors, (19), 26 states have return successors, (27), 25 states have call predecessors, (27), 16 states have call successors, (27) [2024-09-13 03:47:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-09-13 03:47:50,756 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 69 [2024-09-13 03:47:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:47:50,756 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-09-13 03:47:50,756 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 29 states have call successors, (31), 16 states have call predecessors, (31), 34 states have return successors, (34), 32 states have call predecessors, (34), 27 states have call successors, (34) [2024-09-13 03:47:50,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:47:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-09-13 03:47:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-09-13 03:47:50,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:47:50,759 INFO L216 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:47:50,777 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-13 03:47:50,959 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:47:50,960 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:47:50,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:47:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash -103511797, now seen corresponding path program 4 times [2024-09-13 03:47:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:47:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104160073] [2024-09-13 03:47:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:47:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:47:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:47:55,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:47:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:47:55,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:47:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:47:59,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:47:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:03,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:06,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:10,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:12,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:15,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:17,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:19,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:21,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:22,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:23,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:25,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:26,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:27,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:27,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:28,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:28,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:29,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:29,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:29,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:30,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:30,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-13 03:48:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:48:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-09-13 03:48:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:48:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104160073] [2024-09-13 03:48:30,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104160073] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:48:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346189319] [2024-09-13 03:48:30,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:48:30,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:48:30,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:48:30,668 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-13 03:48:30,669 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-13 03:48:31,535 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:48:31,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:48:31,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 281 conjuncts are in the unsatisfiable core [2024-09-13 03:48:31,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:48:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-09-13 03:48:34,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15