./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 4e928bce7a5eba940349fe986fce1ee6d952316584823caa32f480aa4c9f0c38 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:37:03,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:37:03,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:37:03,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:37:03,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:37:03,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:37:03,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:37:03,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:37:03,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:37:03,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:37:03,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:37:03,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:37:03,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:37:03,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:37:03,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:37:03,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:37:03,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:37:03,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:37:03,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:37:03,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:37:03,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:37:03,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:37:03,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:37:03,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:37:03,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:37:03,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:37:03,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:37:03,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:37:03,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:37:03,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:37:03,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:37:03,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:37:03,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:37:03,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:37:03,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:37:03,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:37:03,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:37:03,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:37:03,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:37:03,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:37:03,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:37:03,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:37:03,985 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:37:03,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:37:03,986 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:37:03,986 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:37:03,987 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:37:03,988 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:37:03,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:37:03,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:37:03,989 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:37:03,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:37:03,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:37:03,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:37:03,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:37:03,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:37:04,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:37:04,000 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:37:04,000 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:37:04,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:37:04,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:37:04,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:37:04,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:37:04,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:04,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:37:04,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:37:04,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:37:04,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:37:04,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:37:04,004 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:37:04,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:37:04,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:37:04,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e928bce7a5eba940349fe986fce1ee6d952316584823caa32f480aa4c9f0c38 [2022-11-02 20:37:04,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:37:04,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:37:04,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:37:04,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:37:04,291 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:37:04,293 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i [2022-11-02 20:37:04,361 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/data/c9ef615f3/223eed6f7d7a487f8da1b7fb3dad8bcc/FLAGd15ff9b19 [2022-11-02 20:37:05,333 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:37:05,334 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i [2022-11-02 20:37:05,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/data/c9ef615f3/223eed6f7d7a487f8da1b7fb3dad8bcc/FLAGd15ff9b19 [2022-11-02 20:37:05,735 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/data/c9ef615f3/223eed6f7d7a487f8da1b7fb3dad8bcc [2022-11-02 20:37:05,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:37:05,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:37:05,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:05,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:37:05,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:37:05,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:05" (1/1) ... [2022-11-02 20:37:05,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63930486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:05, skipping insertion in model container [2022-11-02 20:37:05,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:05" (1/1) ... [2022-11-02 20:37:05,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:37:05,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:37:06,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i[209352,209365] [2022-11-02 20:37:07,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:07,874 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:37:08,125 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i[209352,209365] [2022-11-02 20:37:08,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:08,542 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:37:08,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08 WrapperNode [2022-11-02 20:37:08,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:08,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:08,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:37:08,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:37:08,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,811 INFO L138 Inliner]: procedures = 188, calls = 2240, calls flagged for inlining = 91, calls inlined = 86, statements flattened = 4876 [2022-11-02 20:37:08,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:08,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:37:08,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:37:08,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:37:08,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:08,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:09,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:37:09,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:37:09,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:37:09,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:37:09,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (1/1) ... [2022-11-02 20:37:09,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:09,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:37:09,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca4a3d7d-60f2-4e8f-a7d6-27b40ed0fb0e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:37:09,108 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-02 20:37:09,109 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-02 20:37:09,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_alloc_skb_14 [2022-11-02 20:37:09,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_alloc_skb_14 [2022-11-02 20:37:09,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:37:09,109 INFO L130 BoogieDeclarations]: Found specification of procedure sdio_release_host [2022-11-02 20:37:09,109 INFO L138 BoogieDeclarations]: Found implementation of procedure sdio_release_host [2022-11-02 20:37:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_write_data_to_card [2022-11-02 20:37:09,110 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_write_data_to_card [2022-11-02 20:37:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:37:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:37:09,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:37:09,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:37:09,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:37:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure sdio_get_host_pm_caps [2022-11-02 20:37:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure sdio_get_host_pm_caps [2022-11-02 20:37:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_write_data_sync [2022-11-02 20:37:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_write_data_sync [2022-11-02 20:37:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:37:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:37:09,155 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_sdio_card_to_host [2022-11-02 20:37:09,155 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_sdio_card_to_host [2022-11-02 20:37:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure mp_tx_aggr_port_limit_reached [2022-11-02 20:37:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_tx_aggr_port_limit_reached [2022-11-02 20:37:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:37:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:37:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-11-02 20:37:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-11-02 20:37:09,156 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_get_priv [2022-11-02 20:37:09,156 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_get_priv [2022-11-02 20:37:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-02 20:37:09,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-02 20:37:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:37:09,157 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:37:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure usleep_range [2022-11-02 20:37:09,157 INFO L138 BoogieDeclarations]: Found implementation of procedure usleep_range [2022-11-02 20:37:09,157 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_read_reg [2022-11-02 20:37:09,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_read_reg [2022-11-02 20:37:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:37:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_write_reg [2022-11-02 20:37:09,158 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_write_reg [2022-11-02 20:37:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:37:09,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:37:09,158 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_read_data_sync [2022-11-02 20:37:09,158 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_read_data_sync [2022-11-02 20:37:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:37:09,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:37:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u16 [2022-11-02 20:37:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:37:09,159 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:37:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:37:09,159 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 20:37:09,159 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 20:37:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-11-02 20:37:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-11-02 20:37:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:37:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure sdio_release_irq [2022-11-02 20:37:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sdio_release_irq [2022-11-02 20:37:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure sdio_disable_func [2022-11-02 20:37:09,160 INFO L138 BoogieDeclarations]: Found implementation of procedure sdio_disable_func [2022-11-02 20:37:09,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:37:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:37:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure sdio_claim_host [2022-11-02 20:37:09,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sdio_claim_host [2022-11-02 20:37:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_write_reg_locked [2022-11-02 20:37:09,161 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_write_reg_locked [2022-11-02 20:37:09,161 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_sdio_cmdrsp_complete [2022-11-02 20:37:09,161 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_sdio_cmdrsp_complete [2022-11-02 20:37:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:37:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u32 [2022-11-02 20:37:09,162 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 20:37:09,162 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 20:37:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:37:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-02 20:37:09,165 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-02 20:37:09,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:37:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-02 20:37:09,166 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-02 20:37:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 20:37:09,166 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 20:37:09,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-11-02 20:37:09,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-11-02 20:37:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-02 20:37:09,167 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-02 20:37:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-11-02 20:37:09,167 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-11-02 20:37:09,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:37:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_host_to_card_mp_aggr [2022-11-02 20:37:09,168 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_host_to_card_mp_aggr [2022-11-02 20:37:09,168 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_sdio_resume [2022-11-02 20:37:09,169 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_sdio_resume [2022-11-02 20:37:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:37:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2022-11-02 20:37:09,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:37:09,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:37:09,170 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_decode_rx_packet [2022-11-02 20:37:09,171 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_decode_rx_packet [2022-11-02 20:37:09,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:37:09,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:37:09,994 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:37:09,997 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:37:10,118 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:37:20,044 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:37:20,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:37:20,059 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:37:20,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:20 BoogieIcfgContainer [2022-11-02 20:37:20,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:37:20,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:37:20,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:37:20,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:37:20,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:37:05" (1/3) ... [2022-11-02 20:37:20,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13364622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:20, skipping insertion in model container [2022-11-02 20:37:20,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:08" (2/3) ... [2022-11-02 20:37:20,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13364622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:20, skipping insertion in model container [2022-11-02 20:37:20,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:20" (3/3) ... [2022-11-02 20:37:20,077 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--mwifiex--mwifiex_sdio.ko-entry_point.cil.out.i [2022-11-02 20:37:20,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:37:20,096 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:37:20,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:37:20,210 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@42d67e83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:37:20,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:37:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 1067 states, 834 states have (on average 1.4388489208633093) internal successors, (1200), 847 states have internal predecessors, (1200), 192 states have call successors, (192), 40 states have call predecessors, (192), 39 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) [2022-11-02 20:37:20,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:37:20,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:20,249 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:20,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:20,257 INFO L85 PathProgramCache]: Analyzing trace with hash -601957003, now seen corresponding path program 1 times [2022-11-02 20:37:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:20,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53167310] [2022-11-02 20:37:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:37:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:37:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:21,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:37:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:37:21,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:21,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53167310] [2022-11-02 20:37:21,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53167310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:21,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:21,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:37:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569010494] [2022-11-02 20:37:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:21,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:37:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:21,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:37:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:37:21,206 INFO L87 Difference]: Start difference. First operand has 1067 states, 834 states have (on average 1.4388489208633093) internal successors, (1200), 847 states have internal predecessors, (1200), 192 states have call successors, (192), 40 states have call predecessors, (192), 39 states have return successors, (186), 185 states have call predecessors, (186), 186 states have call successors, (186) Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:37:23,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:29,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:30,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:30,200 INFO L93 Difference]: Finished difference Result 3230 states and 4862 transitions. [2022-11-02 20:37:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:37:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-11-02 20:37:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:30,255 INFO L225 Difference]: With dead ends: 3230 [2022-11-02 20:37:30,255 INFO L226 Difference]: Without dead ends: 2148 [2022-11-02 20:37:30,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:37:30,271 INFO L413 NwaCegarLoop]: 1810 mSDtfsCounter, 1720 mSDsluCounter, 2169 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 421 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 3979 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:30,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1841 Valid, 3979 Invalid, 1382 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [421 Valid, 960 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2022-11-02 20:37:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-11-02 20:37:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2066. [2022-11-02 20:37:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 1626 states have (on average 1.4317343173431734) internal successors, (2328), 1636 states have internal predecessors, (2328), 363 states have call successors, (363), 77 states have call predecessors, (363), 76 states have return successors, (362), 360 states have call predecessors, (362), 362 states have call successors, (362) [2022-11-02 20:37:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3053 transitions. [2022-11-02 20:37:30,529 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3053 transitions. Word has length 46 [2022-11-02 20:37:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:30,530 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 3053 transitions. [2022-11-02 20:37:30,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:37:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3053 transitions. [2022-11-02 20:37:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:37:30,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:30,535 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:30,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:37:30,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1981556391, now seen corresponding path program 1 times [2022-11-02 20:37:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:30,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429878300] [2022-11-02 20:37:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:37:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:37:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:37:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:37:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:31,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429878300] [2022-11-02 20:37:31,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429878300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:31,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:31,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:37:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653855462] [2022-11-02 20:37:31,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:31,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:31,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:31,278 INFO L87 Difference]: Start difference. First operand 2066 states and 3053 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:37:33,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:37,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:42,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:43,224 INFO L93 Difference]: Finished difference Result 6335 states and 9421 transitions. [2022-11-02 20:37:43,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:37:43,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-11-02 20:37:43,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:43,248 INFO L225 Difference]: With dead ends: 6335 [2022-11-02 20:37:43,248 INFO L226 Difference]: Without dead ends: 4271 [2022-11-02 20:37:43,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:37:43,257 INFO L413 NwaCegarLoop]: 1727 mSDtfsCounter, 1770 mSDsluCounter, 4869 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 422 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 6596 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:43,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 6596 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 1768 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2022-11-02 20:37:43,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2022-11-02 20:37:43,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 4137. [2022-11-02 20:37:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4137 states, 3257 states have (on average 1.431992631255757) internal successors, (4664), 3279 states have internal predecessors, (4664), 721 states have call successors, (721), 153 states have call predecessors, (721), 158 states have return successors, (738), 720 states have call predecessors, (738), 720 states have call successors, (738) [2022-11-02 20:37:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4137 states to 4137 states and 6123 transitions. [2022-11-02 20:37:43,451 INFO L78 Accepts]: Start accepts. Automaton has 4137 states and 6123 transitions. Word has length 46 [2022-11-02 20:37:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:43,452 INFO L495 AbstractCegarLoop]: Abstraction has 4137 states and 6123 transitions. [2022-11-02 20:37:43,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:37:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4137 states and 6123 transitions. [2022-11-02 20:37:43,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-02 20:37:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:43,468 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:43,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:37:43,469 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -642422905, now seen corresponding path program 1 times [2022-11-02 20:37:43,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:43,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247624006] [2022-11-02 20:37:43,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:43,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:37:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:37:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:37:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:37:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:37:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:37:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:37:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:37:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:43,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:37:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:37:44,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:44,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247624006] [2022-11-02 20:37:44,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247624006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:44,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:44,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:37:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634090030] [2022-11-02 20:37:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:44,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:37:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:37:44,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:37:44,013 INFO L87 Difference]: Start difference. First operand 4137 states and 6123 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:37:46,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:50,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:37:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:51,631 INFO L93 Difference]: Finished difference Result 6996 states and 10303 transitions. [2022-11-02 20:37:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:37:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2022-11-02 20:37:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:51,647 INFO L225 Difference]: With dead ends: 6996 [2022-11-02 20:37:51,648 INFO L226 Difference]: Without dead ends: 2871 [2022-11-02 20:37:51,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:51,660 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 768 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 458 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 3510 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:51,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 3510 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 913 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 20:37:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2022-11-02 20:37:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2756. [2022-11-02 20:37:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2189 states have (on average 1.423937871174052) internal successors, (3117), 2202 states have internal predecessors, (3117), 446 states have call successors, (446), 118 states have call predecessors, (446), 120 states have return successors, (456), 443 states have call predecessors, (456), 445 states have call successors, (456) [2022-11-02 20:37:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4019 transitions. [2022-11-02 20:37:51,847 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4019 transitions. Word has length 103 [2022-11-02 20:37:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:51,850 INFO L495 AbstractCegarLoop]: Abstraction has 2756 states and 4019 transitions. [2022-11-02 20:37:51,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 20:37:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4019 transitions. [2022-11-02 20:37:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-02 20:37:51,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:51,858 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:51,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:37:51,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:37:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:51,859 INFO L85 PathProgramCache]: Analyzing trace with hash 96929181, now seen corresponding path program 1 times [2022-11-02 20:37:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:51,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119334319] [2022-11-02 20:37:51,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:51,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:37:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:37:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:37:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:37:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:37:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:37:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:37:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:37:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:37:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:37:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:37:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:37:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:37:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-11-02 20:37:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119334319] [2022-11-02 20:37:53,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119334319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:53,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:53,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:37:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745463128] [2022-11-02 20:37:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:53,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:37:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:53,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:37:53,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:37:53,279 INFO L87 Difference]: Start difference. First operand 2756 states and 4019 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:37:55,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:00,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:00,930 INFO L93 Difference]: Finished difference Result 5380 states and 7886 transitions. [2022-11-02 20:38:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:38:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 144 [2022-11-02 20:38:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:00,944 INFO L225 Difference]: With dead ends: 5380 [2022-11-02 20:38:00,944 INFO L226 Difference]: Without dead ends: 2846 [2022-11-02 20:38:00,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:38:00,951 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 313 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 384 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 6017 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:00,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 6017 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1458 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-11-02 20:38:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2022-11-02 20:38:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2756. [2022-11-02 20:38:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2187 states have (on average 1.4224965706447188) internal successors, (3111), 2201 states have internal predecessors, (3111), 446 states have call successors, (446), 118 states have call predecessors, (446), 122 states have return successors, (462), 444 states have call predecessors, (462), 445 states have call successors, (462) [2022-11-02 20:38:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4019 transitions. [2022-11-02 20:38:01,065 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4019 transitions. Word has length 144 [2022-11-02 20:38:01,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:01,066 INFO L495 AbstractCegarLoop]: Abstraction has 2756 states and 4019 transitions. [2022-11-02 20:38:01,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:38:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4019 transitions. [2022-11-02 20:38:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 20:38:01,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:01,073 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:01,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:38:01,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:38:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash 36910958, now seen corresponding path program 1 times [2022-11-02 20:38:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:01,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110327280] [2022-11-02 20:38:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:38:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:38:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:38:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:38:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:38:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:38:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:38:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:38:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:38:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:38:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:38:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:05,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:05,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:38:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-11-02 20:38:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110327280] [2022-11-02 20:38:05,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110327280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:05,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:05,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:38:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390377649] [2022-11-02 20:38:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:05,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:38:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:38:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:38:05,972 INFO L87 Difference]: Start difference. First operand 2756 states and 4019 transitions. Second operand has 17 states, 16 states have (on average 6.0) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:38:08,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:10,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:21,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:26,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:28,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:32,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:33,720 INFO L93 Difference]: Finished difference Result 6799 states and 10167 transitions. [2022-11-02 20:38:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:38:33,721 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 151 [2022-11-02 20:38:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:33,742 INFO L225 Difference]: With dead ends: 6799 [2022-11-02 20:38:33,742 INFO L226 Difference]: Without dead ends: 4265 [2022-11-02 20:38:33,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:38:33,751 INFO L413 NwaCegarLoop]: 2375 mSDtfsCounter, 839 mSDsluCounter, 28355 mSDsCounter, 0 mSdLazyCounter, 6702 mSolverCounterSat, 201 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 30730 SdHoareTripleChecker+Invalid, 6908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 6702 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:33,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 30730 Invalid, 6908 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [201 Valid, 6702 Invalid, 5 Unknown, 0 Unchecked, 27.1s Time] [2022-11-02 20:38:33,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2022-11-02 20:38:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 2763. [2022-11-02 20:38:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2193 states have (on average 1.4204286365709073) internal successors, (3115), 2205 states have internal predecessors, (3115), 446 states have call successors, (446), 118 states have call predecessors, (446), 123 states have return successors, (464), 447 states have call predecessors, (464), 445 states have call successors, (464) [2022-11-02 20:38:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 4025 transitions. [2022-11-02 20:38:33,947 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 4025 transitions. Word has length 151 [2022-11-02 20:38:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:33,948 INFO L495 AbstractCegarLoop]: Abstraction has 2763 states and 4025 transitions. [2022-11-02 20:38:33,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.0) internal successors, (96), 11 states have internal predecessors, (96), 3 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:38:33,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 4025 transitions. [2022-11-02 20:38:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-11-02 20:38:33,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:33,957 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:33,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:38:33,958 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:38:33,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1511771000, now seen corresponding path program 1 times [2022-11-02 20:38:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:33,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682878595] [2022-11-02 20:38:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:38:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:38:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:38:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:38:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:38:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:38:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:38:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:38:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:38:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:38:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:38:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:38:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:38:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:38:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:38:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:38:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-02 20:38:34,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:34,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682878595] [2022-11-02 20:38:34,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682878595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:34,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:34,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:38:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216524552] [2022-11-02 20:38:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:34,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:38:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:34,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:38:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:38:34,741 INFO L87 Difference]: Start difference. First operand 2763 states and 4025 transitions. Second operand has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:38:36,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:44,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:46,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:51,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:52,591 INFO L93 Difference]: Finished difference Result 8015 states and 12105 transitions. [2022-11-02 20:38:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:38:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 190 [2022-11-02 20:38:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:52,618 INFO L225 Difference]: With dead ends: 8015 [2022-11-02 20:38:52,619 INFO L226 Difference]: Without dead ends: 5474 [2022-11-02 20:38:52,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:38:52,626 INFO L413 NwaCegarLoop]: 2474 mSDtfsCounter, 1931 mSDsluCounter, 5923 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 406 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 8397 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:52,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 8397 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2425 Invalid, 2 Unknown, 0 Unchecked, 17.5s Time] [2022-11-02 20:38:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2022-11-02 20:38:52,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 2767. [2022-11-02 20:38:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2767 states, 2197 states have (on average 1.4196631770596269) internal successors, (3119), 2209 states have internal predecessors, (3119), 446 states have call successors, (446), 118 states have call predecessors, (446), 123 states have return successors, (464), 447 states have call predecessors, (464), 445 states have call successors, (464) [2022-11-02 20:38:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 4029 transitions. [2022-11-02 20:38:52,856 INFO L78 Accepts]: Start accepts. Automaton has 2767 states and 4029 transitions. Word has length 190 [2022-11-02 20:38:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:52,856 INFO L495 AbstractCegarLoop]: Abstraction has 2767 states and 4029 transitions. [2022-11-02 20:38:52,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:38:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 4029 transitions. [2022-11-02 20:38:52,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-02 20:38:52,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:52,872 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:52,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:38:52,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:38:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1309859301, now seen corresponding path program 1 times [2022-11-02 20:38:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:52,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331839932] [2022-11-02 20:38:52,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:38:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:38:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:38:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:38:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:38:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:38:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:38:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:38:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:38:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:38:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:38:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:38:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:38:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:38:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:38:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:38:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:38:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:38:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-02 20:38:53,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:53,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331839932] [2022-11-02 20:38:53,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331839932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:53,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:53,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:38:53,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472013237] [2022-11-02 20:38:53,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:53,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:38:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:38:53,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:38:53,531 INFO L87 Difference]: Start difference. First operand 2767 states and 4029 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:38:55,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:38:57,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:39:04,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:39:06,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:39:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:39:07,924 INFO L93 Difference]: Finished difference Result 5397 states and 7888 transitions. [2022-11-02 20:39:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:39:07,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 200 [2022-11-02 20:39:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:39:07,936 INFO L225 Difference]: With dead ends: 5397 [2022-11-02 20:39:07,937 INFO L226 Difference]: Without dead ends: 2852 [2022-11-02 20:39:07,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:39:07,943 INFO L413 NwaCegarLoop]: 1502 mSDtfsCounter, 156 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 191 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:39:07,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 4146 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1438 Invalid, 3 Unknown, 0 Unchecked, 14.2s Time] [2022-11-02 20:39:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2022-11-02 20:39:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2769. [2022-11-02 20:39:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2769 states, 2199 states have (on average 1.419281491587085) internal successors, (3121), 2211 states have internal predecessors, (3121), 446 states have call successors, (446), 118 states have call predecessors, (446), 123 states have return successors, (464), 447 states have call predecessors, (464), 445 states have call successors, (464) [2022-11-02 20:39:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 4031 transitions. [2022-11-02 20:39:08,100 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 4031 transitions. Word has length 200 [2022-11-02 20:39:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:39:08,100 INFO L495 AbstractCegarLoop]: Abstraction has 2769 states and 4031 transitions. [2022-11-02 20:39:08,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:39:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 4031 transitions. [2022-11-02 20:39:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-02 20:39:08,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:39:08,110 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:39:08,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:39:08,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:39:08,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:08,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1768954269, now seen corresponding path program 1 times [2022-11-02 20:39:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:08,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363125605] [2022-11-02 20:39:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:39:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:39:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:39:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:39:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:39:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:39:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:39:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:39:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:39:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:39:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:39:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:39:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:39:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:39:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-02 20:39:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:39:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:39:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:52,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:39:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-02 20:39:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363125605] [2022-11-02 20:39:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363125605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:39:52,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:39:52,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:39:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938545260] [2022-11-02 20:39:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:39:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:39:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:39:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:39:52,259 INFO L87 Difference]: Start difference. First operand 2769 states and 4031 transitions. Second operand has 17 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 5 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:39:54,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:00,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:07,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:11,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:16,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:16,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:16,608 INFO L93 Difference]: Finished difference Result 6978 states and 10415 transitions. [2022-11-02 20:40:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:40:16,609 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 5 states have call predecessors, (20), 2 states have call successors, (20) Word has length 200 [2022-11-02 20:40:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:16,627 INFO L225 Difference]: With dead ends: 6978 [2022-11-02 20:40:16,628 INFO L226 Difference]: Without dead ends: 4431 [2022-11-02 20:40:16,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:40:16,634 INFO L413 NwaCegarLoop]: 2437 mSDtfsCounter, 1081 mSDsluCounter, 27923 mSDsCounter, 0 mSdLazyCounter, 5940 mSolverCounterSat, 413 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 30360 SdHoareTripleChecker+Invalid, 6357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 5940 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:16,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 30360 Invalid, 6357 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [413 Valid, 5940 Invalid, 4 Unknown, 0 Unchecked, 23.6s Time] [2022-11-02 20:40:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4431 states. [2022-11-02 20:40:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4431 to 2773. [2022-11-02 20:40:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2773 states, 2203 states have (on average 1.4185201997276442) internal successors, (3125), 2213 states have internal predecessors, (3125), 446 states have call successors, (446), 118 states have call predecessors, (446), 123 states have return successors, (464), 449 states have call predecessors, (464), 445 states have call successors, (464) [2022-11-02 20:40:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2773 states to 2773 states and 4035 transitions. [2022-11-02 20:40:16,834 INFO L78 Accepts]: Start accepts. Automaton has 2773 states and 4035 transitions. Word has length 200 [2022-11-02 20:40:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:16,834 INFO L495 AbstractCegarLoop]: Abstraction has 2773 states and 4035 transitions. [2022-11-02 20:40:16,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.9375) internal successors, (127), 11 states have internal predecessors, (127), 3 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (20), 5 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 20:40:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2773 states and 4035 transitions. [2022-11-02 20:40:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-11-02 20:40:16,844 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:16,845 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:16,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:40:16,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1821148220, now seen corresponding path program 1 times [2022-11-02 20:40:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:16,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911241363] [2022-11-02 20:40:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:40:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:40:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:40:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:40:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:40:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:40:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:40:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:40:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:40:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:40:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:40:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:40:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:40:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:40:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-02 20:40:17,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:17,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911241363] [2022-11-02 20:40:17,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911241363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:17,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:17,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:40:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024722158] [2022-11-02 20:40:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:17,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:40:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:17,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:40:17,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:17,474 INFO L87 Difference]: Start difference. First operand 2773 states and 4035 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:40:19,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:40:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:40:30,372 INFO L93 Difference]: Finished difference Result 5411 states and 7910 transitions. [2022-11-02 20:40:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:40:30,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 202 [2022-11-02 20:40:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:40:30,384 INFO L225 Difference]: With dead ends: 5411 [2022-11-02 20:40:30,385 INFO L226 Difference]: Without dead ends: 2860 [2022-11-02 20:40:30,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:40:30,392 INFO L413 NwaCegarLoop]: 1489 mSDtfsCounter, 226 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 215 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 4991 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:40:30,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 4991 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1748 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2022-11-02 20:40:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-11-02 20:40:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2771. [2022-11-02 20:40:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2201 states have (on average 1.4179918218991368) internal successors, (3121), 2211 states have internal predecessors, (3121), 446 states have call successors, (446), 118 states have call predecessors, (446), 123 states have return successors, (464), 449 states have call predecessors, (464), 445 states have call successors, (464) [2022-11-02 20:40:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4031 transitions. [2022-11-02 20:40:30,564 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4031 transitions. Word has length 202 [2022-11-02 20:40:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:40:30,565 INFO L495 AbstractCegarLoop]: Abstraction has 2771 states and 4031 transitions. [2022-11-02 20:40:30,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 7 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 20:40:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4031 transitions. [2022-11-02 20:40:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-02 20:40:30,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:40:30,575 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:40:30,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:40:30,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:40:30,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:40:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1890952605, now seen corresponding path program 1 times [2022-11-02 20:40:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:40:30,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108174194] [2022-11-02 20:40:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:40:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:40:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:40:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:40:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:40:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 20:40:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:40:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:40:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:40:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 20:40:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:40:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-02 20:40:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 20:40:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:40:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:40:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:40:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:40:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 20:40:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:40:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:40:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:40:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-02 20:40:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:40:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-02 20:40:31,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:40:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108174194] [2022-11-02 20:40:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108174194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:40:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:40:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:40:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350078560] [2022-11-02 20:40:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:40:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:40:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:40:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:40:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:40:31,263 INFO L87 Difference]: Start difference. First operand 2771 states and 4031 transitions. Second operand has 8 states, 8 states have (on average 17.0) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 20:40:33,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []