./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/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_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/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_9403b93c-d1f2-480e-98d1-290b92aac3e1/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 271771768c3380f5979c29c79a53c5e282857dcb6c4c2b744d0fa4e6e2c0dd66 --- 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:53:51,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:51,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:51,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:51,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:51,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:51,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:51,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:51,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:51,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:51,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:51,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:51,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:51,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:51,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:51,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:51,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:51,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:51,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:51,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:51,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:51,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:51,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:51,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:51,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:51,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:51,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:51,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:51,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:51,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:51,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:51,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:51,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:51,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:51,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:51,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:51,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:51,880 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:51,880 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:51,881 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:51,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:51,883 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:53:51,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:51,920 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:51,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:51,926 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:51,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:51,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:51,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:51,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:51,928 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:51,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:51,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:51,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:51,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:53:51,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:51,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:53:51,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:53:51,931 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:51,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:53:51,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:51,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:51,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:51,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:51,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:51,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:51,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:53:51,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:51,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:51,934 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:53:51,934 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:53:51,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:53:51,935 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_9403b93c-d1f2-480e-98d1-290b92aac3e1/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_9403b93c-d1f2-480e-98d1-290b92aac3e1/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 -> 271771768c3380f5979c29c79a53c5e282857dcb6c4c2b744d0fa4e6e2c0dd66 [2022-11-02 20:53:52,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:52,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:52,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:52,259 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:52,260 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:52,261 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:53:52,340 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/data/24b94da84/4cf912603e974a7487255d1d2e5d549a/FLAG3032d7021 [2022-11-02 20:53:53,167 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:53,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:53:53,224 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/data/24b94da84/4cf912603e974a7487255d1d2e5d549a/FLAG3032d7021 [2022-11-02 20:53:53,698 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/data/24b94da84/4cf912603e974a7487255d1d2e5d549a [2022-11-02 20:53:53,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:53,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:53,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:53,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:53,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:53,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:53" (1/1) ... [2022-11-02 20:53:53,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f3db8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:53, skipping insertion in model container [2022-11-02 20:53:53,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:53" (1/1) ... [2022-11-02 20:53:53,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:53,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:55,357 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_9403b93c-d1f2-480e-98d1-290b92aac3e1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i[185985,185998] [2022-11-02 20:53:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:55,413 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:55,671 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_9403b93c-d1f2-480e-98d1-290b92aac3e1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i[185985,185998] [2022-11-02 20:53:55,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:55,796 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:55,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55 WrapperNode [2022-11-02 20:53:55,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:55,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:55,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:55,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:55,809 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:53:55" (1/1) ... [2022-11-02 20:53:55,878 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:53:55" (1/1) ... [2022-11-02 20:53:56,014 INFO L138 Inliner]: procedures = 159, calls = 1227, calls flagged for inlining = 70, calls inlined = 70, statements flattened = 3009 [2022-11-02 20:53:56,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:56,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:56,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:56,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:56,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,245 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:56,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:56,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:56,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:56,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (1/1) ... [2022-11-02 20:53:56,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:56,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:56,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:56,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:56,409 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_set_rds_radio_text [2022-11-02 20:53:56,409 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_set_rds_radio_text [2022-11-02 20:53:56,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:53:56,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:53:56,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:53:56,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:53:56,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:53:56,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:56,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:53:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:53:56,411 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_is_valid [2022-11-02 20:53:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_is_valid [2022-11-02 20:53:56,411 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_wait_stc [2022-11-02 20:53:56,411 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_wait_stc [2022-11-02 20:53:56,412 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_usecs [2022-11-02 20:53:56,412 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_usecs [2022-11-02 20:53:56,412 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_set_mute [2022-11-02 20:53:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_set_mute [2022-11-02 20:53:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:53:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:53:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-11-02 20:53:56,413 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-11-02 20:53:56,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:53:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:53:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_set_power_state [2022-11-02 20:53:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_set_power_state [2022-11-02 20:53:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_choose_econtrol_action [2022-11-02 20:53:56,414 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_choose_econtrol_action [2022-11-02 20:53:56,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_len [2022-11-02 20:53:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_len [2022-11-02 20:53:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:53:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:53:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-11-02 20:53:56,415 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-11-02 20:53:56,415 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_write_econtrol_tune [2022-11-02 20:53:56,416 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_write_econtrol_tune [2022-11-02 20:53:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 20:53:56,417 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 20:53:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-02 20:53:56,417 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-02 20:53:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2022-11-02 20:53:56,417 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2022-11-02 20:53:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:53:56,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:53:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_strlen [2022-11-02 20:53:56,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_strlen [2022-11-02 20:53:56,418 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value [2022-11-02 20:53:56,418 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value [2022-11-02 20:53:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:53:56,419 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:53:56,419 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_tx_rds_buff [2022-11-02 20:53:56,419 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_tx_rds_buff [2022-11-02 20:53:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:53:56,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:53:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:53:56,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:53:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:53:56,423 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_query_fill [2022-11-02 20:53:56,423 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_query_fill [2022-11-02 20:53:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure validate_range [2022-11-02 20:53:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure validate_range [2022-11-02 20:53:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_bulk_free [2022-11-02 20:53:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_bulk_free [2022-11-02 20:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_write_econtrol_integers [2022-11-02 20:53:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_write_econtrol_integers [2022-11-02 20:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:53:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:53:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:53:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_bulk_disable [2022-11-02 20:53:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_bulk_disable [2022-11-02 20:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_free [2022-11-02 20:53:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_free [2022-11-02 20:53:56,427 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-11-02 20:53:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-11-02 20:53:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_send_command [2022-11-02 20:53:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_send_command [2022-11-02 20:53:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_get_subdevdata [2022-11-02 20:53:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_get_subdevdata [2022-11-02 20:53:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure usecs_to_jiffies [2022-11-02 20:53:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure usecs_to_jiffies [2022-11-02 20:53:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_write_property [2022-11-02 20:53:56,429 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_write_property [2022-11-02 20:53:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:53:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-11-02 20:53:56,429 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-11-02 20:53:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:53:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_read_property [2022-11-02 20:53:56,431 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_read_property [2022-11-02 20:53:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 20:53:56,431 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 20:53:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_s_frequency [2022-11-02 20:53:56,431 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_s_frequency [2022-11-02 20:53:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_copy_from_user_7 [2022-11-02 20:53:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_copy_from_user_7 [2022-11-02 20:53:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:53:56,433 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:53:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 20:53:56,434 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 20:53:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_tx_tune_status [2022-11-02 20:53:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_tx_tune_status [2022-11-02 20:53:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_ret_val [2022-11-02 20:53:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_ret_val [2022-11-02 20:53:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_update_tune_status [2022-11-02 20:53:56,435 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_update_tune_status [2022-11-02 20:53:56,435 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_set_rds_ps_name [2022-11-02 20:53:56,436 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_set_rds_ps_name [2022-11-02 20:53:56,436 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_queryctrl [2022-11-02 20:53:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_queryctrl [2022-11-02 20:53:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure si4713_s_modulator [2022-11-02 20:53:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure si4713_s_modulator [2022-11-02 20:53:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:53:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-02 20:53:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:56,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:57,126 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:57,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:57,532 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:54:03,619 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:54:03,633 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:54:03,633 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:54:03,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:03 BoogieIcfgContainer [2022-11-02 20:54:03,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:54:03,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:54:03,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:54:03,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:54:03,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:53" (1/3) ... [2022-11-02 20:54:03,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:03, skipping insertion in model container [2022-11-02 20:54:03,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:55" (2/3) ... [2022-11-02 20:54:03,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:54:03, skipping insertion in model container [2022-11-02 20:54:03,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:54:03" (3/3) ... [2022-11-02 20:54:03,645 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-064368f-1-111_1a-drivers--media--radio--si4713-i2c.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:54:03,664 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:54:03,664 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:54:03,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:54:03,743 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;@1ed7910c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:54:03,743 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:54:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 1039 states, 770 states have (on average 1.4025974025974026) internal successors, (1080), 786 states have internal predecessors, (1080), 217 states have call successors, (217), 51 states have call predecessors, (217), 50 states have return successors, (209), 209 states have call predecessors, (209), 209 states have call successors, (209) [2022-11-02 20:54:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:54:03,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:03,777 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:03,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1529596494, now seen corresponding path program 1 times [2022-11-02 20:54:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:03,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314001311] [2022-11-02 20:54:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:54:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:54:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:54:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:54:04,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:04,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314001311] [2022-11-02 20:54:04,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314001311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:04,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:04,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:54:04,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766980551] [2022-11-02 20:54:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:04,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:54:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:04,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:54:04,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:54:04,680 INFO L87 Difference]: Start difference. First operand has 1039 states, 770 states have (on average 1.4025974025974026) internal successors, (1080), 786 states have internal predecessors, (1080), 217 states have call successors, (217), 51 states have call predecessors, (217), 50 states have return successors, (209), 209 states have call predecessors, (209), 209 states have call successors, (209) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:54:10,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:12,351 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:54:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:12,767 INFO L93 Difference]: Finished difference Result 2153 states and 3163 transitions. [2022-11-02 20:54:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:54:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2022-11-02 20:54:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:12,811 INFO L225 Difference]: With dead ends: 2153 [2022-11-02 20:54:12,819 INFO L226 Difference]: Without dead ends: 1101 [2022-11-02 20:54:12,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:12,843 INFO L413 NwaCegarLoop]: 1407 mSDtfsCounter, 602 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 569 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 2732 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:12,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 2732 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 843 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-11-02 20:54:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-11-02 20:54:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1022. [2022-11-02 20:54:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 762 states have (on average 1.3910761154855642) internal successors, (1060), 769 states have internal predecessors, (1060), 209 states have call successors, (209), 50 states have call predecessors, (209), 50 states have return successors, (209), 209 states have call predecessors, (209), 209 states have call successors, (209) [2022-11-02 20:54:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1478 transitions. [2022-11-02 20:54:13,051 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1478 transitions. Word has length 94 [2022-11-02 20:54:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:13,052 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 1478 transitions. [2022-11-02 20:54:13,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:54:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1478 transitions. [2022-11-02 20:54:13,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-02 20:54:13,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:13,073 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:54:13,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -390287148, now seen corresponding path program 1 times [2022-11-02 20:54:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:13,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393703674] [2022-11-02 20:54:13,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:54:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:54:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:54:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-02 20:54:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393703674] [2022-11-02 20:54:13,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393703674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:13,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:13,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:54:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248342835] [2022-11-02 20:54:13,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:13,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:54:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:54:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:54:13,602 INFO L87 Difference]: Start difference. First operand 1022 states and 1478 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:54:17,402 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:54:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:21,488 INFO L93 Difference]: Finished difference Result 2609 states and 3766 transitions. [2022-11-02 20:54:21,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:21,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2022-11-02 20:54:21,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:21,505 INFO L225 Difference]: With dead ends: 2609 [2022-11-02 20:54:21,508 INFO L226 Difference]: Without dead ends: 1599 [2022-11-02 20:54:21,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:54:21,515 INFO L413 NwaCegarLoop]: 1466 mSDtfsCounter, 1453 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 803 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:21,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 3831 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 1450 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-11-02 20:54:21,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2022-11-02 20:54:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1469. [2022-11-02 20:54:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1102 states have (on average 1.382032667876588) internal successors, (1523), 1114 states have internal predecessors, (1523), 286 states have call successors, (286), 80 states have call predecessors, (286), 80 states have return successors, (286), 285 states have call predecessors, (286), 286 states have call successors, (286) [2022-11-02 20:54:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2095 transitions. [2022-11-02 20:54:21,623 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2095 transitions. Word has length 94 [2022-11-02 20:54:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:21,625 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 2095 transitions. [2022-11-02 20:54:21,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-02 20:54:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2095 transitions. [2022-11-02 20:54:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-02 20:54:21,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:21,638 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2022-11-02 20:54:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:54:21,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash 606339028, now seen corresponding path program 1 times [2022-11-02 20:54:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:21,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366026484] [2022-11-02 20:54:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:21,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:22,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:54:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:54:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:54:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:54:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:54:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:54:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:54:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:54:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:54:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:54:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2022-11-02 20:54:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:23,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366026484] [2022-11-02 20:54:23,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366026484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:23,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:23,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:54:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624054012] [2022-11-02 20:54:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:23,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:54:23,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:23,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:54:23,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:54:23,494 INFO L87 Difference]: Start difference. First operand 1469 states and 2095 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:54:29,665 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:54:30,755 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:54:32,771 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:54:34,795 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:54:36,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:37,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:39,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:49,891 INFO L93 Difference]: Finished difference Result 3783 states and 5392 transitions. [2022-11-02 20:54:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:54:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) Word has length 222 [2022-11-02 20:54:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:49,908 INFO L225 Difference]: With dead ends: 3783 [2022-11-02 20:54:49,908 INFO L226 Difference]: Without dead ends: 2330 [2022-11-02 20:54:49,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:54:49,916 INFO L413 NwaCegarLoop]: 1629 mSDtfsCounter, 1299 mSDsluCounter, 8533 mSDsCounter, 0 mSdLazyCounter, 7097 mSolverCounterSat, 825 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 10162 SdHoareTripleChecker+Invalid, 7925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 825 IncrementalHoareTripleChecker+Valid, 7097 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:49,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 10162 Invalid, 7925 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [825 Valid, 7097 Invalid, 3 Unknown, 0 Unchecked, 25.8s Time] [2022-11-02 20:54:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2022-11-02 20:54:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2186. [2022-11-02 20:54:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1639 states have (on average 1.3746186699206833) internal successors, (2253), 1666 states have internal predecessors, (2253), 404 states have call successors, (404), 132 states have call predecessors, (404), 142 states have return successors, (457), 398 states have call predecessors, (457), 404 states have call successors, (457) [2022-11-02 20:54:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3114 transitions. [2022-11-02 20:54:50,034 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3114 transitions. Word has length 222 [2022-11-02 20:54:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:50,035 INFO L495 AbstractCegarLoop]: Abstraction has 2186 states and 3114 transitions. [2022-11-02 20:54:50,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (18), 5 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:54:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3114 transitions. [2022-11-02 20:54:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-02 20:54:50,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:50,047 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:54:50,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2079558733, now seen corresponding path program 1 times [2022-11-02 20:54:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:50,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669925519] [2022-11-02 20:54:50,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:54:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:54:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:54:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:54:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:54:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:54:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:54:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:54:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:54:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:54:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:54:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-02 20:54:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:54:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-02 20:54:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-11-02 20:54:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669925519] [2022-11-02 20:54:50,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669925519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:54:50,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:54:50,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:54:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744385899] [2022-11-02 20:54:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:54:50,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:54:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:54:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:54:50,843 INFO L87 Difference]: Start difference. First operand 2186 states and 3114 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 20:54:54,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:55,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:54:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:59,346 INFO L93 Difference]: Finished difference Result 2307 states and 3282 transitions. [2022-11-02 20:54:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:54:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 244 [2022-11-02 20:54:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:59,363 INFO L225 Difference]: With dead ends: 2307 [2022-11-02 20:54:59,363 INFO L226 Difference]: Without dead ends: 2305 [2022-11-02 20:54:59,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:54:59,368 INFO L413 NwaCegarLoop]: 1388 mSDtfsCounter, 608 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 4818 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:59,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 4818 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-11-02 20:54:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2022-11-02 20:54:59,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2190. [2022-11-02 20:54:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 1642 states have (on average 1.3733252131546894) internal successors, (2255), 1669 states have internal predecessors, (2255), 404 states have call successors, (404), 133 states have call predecessors, (404), 143 states have return successors, (457), 398 states have call predecessors, (457), 404 states have call successors, (457) [2022-11-02 20:54:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3116 transitions. [2022-11-02 20:54:59,484 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3116 transitions. Word has length 244 [2022-11-02 20:54:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:59,486 INFO L495 AbstractCegarLoop]: Abstraction has 2190 states and 3116 transitions. [2022-11-02 20:54:59,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 20:54:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3116 transitions. [2022-11-02 20:54:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-02 20:54:59,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:59,500 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 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] [2022-11-02 20:54:59,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:54:59,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1521878376, now seen corresponding path program 1 times [2022-11-02 20:54:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:59,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622697064] [2022-11-02 20:54:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:55:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:55:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:55:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:55:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:55:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:55:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:55:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:55:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:55:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-02 20:55:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:55:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:55:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2022-11-02 20:55:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:01,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622697064] [2022-11-02 20:55:01,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622697064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:01,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:01,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:55:01,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862669468] [2022-11-02 20:55:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:01,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:55:01,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:01,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:55:01,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:55:01,843 INFO L87 Difference]: Start difference. First operand 2190 states and 3116 transitions. Second operand has 11 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:55:06,772 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:55:07,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:10,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:12,167 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:55:18,584 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:55:20,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:22,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:28,231 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:55:30,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:32,127 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:55:34,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:55:35,068 INFO L93 Difference]: Finished difference Result 5010 states and 7233 transitions. [2022-11-02 20:55:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:55:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 243 [2022-11-02 20:55:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:55:35,085 INFO L225 Difference]: With dead ends: 5010 [2022-11-02 20:55:35,085 INFO L226 Difference]: Without dead ends: 2836 [2022-11-02 20:55:35,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:55:35,094 INFO L413 NwaCegarLoop]: 1765 mSDtfsCounter, 1240 mSDsluCounter, 6812 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 847 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 8577 SdHoareTripleChecker+Invalid, 5488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 847 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:55:35,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 8577 Invalid, 5488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [847 Valid, 4634 Invalid, 7 Unknown, 0 Unchecked, 32.9s Time] [2022-11-02 20:55:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2022-11-02 20:55:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2196. [2022-11-02 20:55:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2196 states, 1647 states have (on average 1.3727990285367335) internal successors, (2261), 1674 states have internal predecessors, (2261), 404 states have call successors, (404), 133 states have call predecessors, (404), 144 states have return successors, (460), 399 states have call predecessors, (460), 404 states have call successors, (460) [2022-11-02 20:55:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3125 transitions. [2022-11-02 20:55:35,202 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3125 transitions. Word has length 243 [2022-11-02 20:55:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:55:35,203 INFO L495 AbstractCegarLoop]: Abstraction has 2196 states and 3125 transitions. [2022-11-02 20:55:35,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:55:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3125 transitions. [2022-11-02 20:55:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-02 20:55:35,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:55:35,215 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 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] [2022-11-02 20:55:35,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:55:35,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:55:35,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:55:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 891996621, now seen corresponding path program 1 times [2022-11-02 20:55:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:55:35,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556376922] [2022-11-02 20:55:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:55:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:55:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:55:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:55:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:55:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:55:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:55:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:55:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:55:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:55:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:55:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:55:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:55:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:55:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-02 20:55:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:55:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:55:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:55:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:55:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2022-11-02 20:55:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:55:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556376922] [2022-11-02 20:55:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556376922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:55:37,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:55:37,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:55:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452245362] [2022-11-02 20:55:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:55:37,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:55:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:55:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:55:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:55:37,407 INFO L87 Difference]: Start difference. First operand 2196 states and 3125 transitions. Second operand has 12 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:55:42,551 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:55:44,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:46,059 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:55:48,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:49,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:55:58,175 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:56:00,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:07,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:08,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:09,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:11,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:12,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:14,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:15,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:56:17,743 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:56:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:18,449 INFO L93 Difference]: Finished difference Result 6454 states and 9562 transitions. [2022-11-02 20:56:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:56:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 244 [2022-11-02 20:56:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:18,475 INFO L225 Difference]: With dead ends: 6454 [2022-11-02 20:56:18,475 INFO L226 Difference]: Without dead ends: 4274 [2022-11-02 20:56:18,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:56:18,486 INFO L413 NwaCegarLoop]: 2667 mSDtfsCounter, 1802 mSDsluCounter, 12413 mSDsCounter, 0 mSdLazyCounter, 6939 mSolverCounterSat, 990 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1983 SdHoareTripleChecker+Valid, 15080 SdHoareTripleChecker+Invalid, 7935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 6939 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:18,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1983 Valid, 15080 Invalid, 7935 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [990 Valid, 6939 Invalid, 6 Unknown, 0 Unchecked, 40.5s Time] [2022-11-02 20:56:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4274 states. [2022-11-02 20:56:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4274 to 2197. [2022-11-02 20:56:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2197 states, 1648 states have (on average 1.3725728155339805) internal successors, (2262), 1675 states have internal predecessors, (2262), 404 states have call successors, (404), 133 states have call predecessors, (404), 144 states have return successors, (460), 399 states have call predecessors, (460), 404 states have call successors, (460) [2022-11-02 20:56:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2197 states to 2197 states and 3126 transitions. [2022-11-02 20:56:18,637 INFO L78 Accepts]: Start accepts. Automaton has 2197 states and 3126 transitions. Word has length 244 [2022-11-02 20:56:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:18,638 INFO L495 AbstractCegarLoop]: Abstraction has 2197 states and 3126 transitions. [2022-11-02 20:56:18,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.7) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-02 20:56:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2197 states and 3126 transitions. [2022-11-02 20:56:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-02 20:56:18,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:18,651 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 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] [2022-11-02 20:56:18,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:56:18,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_lenErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:56:18,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1765070977, now seen corresponding path program 1 times [2022-11-02 20:56:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733148112] [2022-11-02 20:56:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:56:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:56:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:56:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:56:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 20:56:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:56:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:56:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:56:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 20:56:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:56:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 20:56:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:56:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:56:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-02 20:56:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 20:56:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-11-02 20:56:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:56:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 107 proven. 20 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2022-11-02 20:56:22,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:22,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733148112] [2022-11-02 20:56:22,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733148112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:22,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394764725] [2022-11-02 20:56:22,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:22,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:22,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9403b93c-d1f2-480e-98d1-290b92aac3e1/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:56:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:23,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 2199 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:56:23,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:23,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:56:23,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:24,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,177 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:56:24,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:56:24,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:24,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,409 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:56:24,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:56:24,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:24,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:56:24,603 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:56:24,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:56:24,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:24,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-02 20:56:24,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:56:39,116 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:56:39,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:56:39,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-02 20:56:39,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-02 20:56:39,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-02 20:56:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 263 proven. 72 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2022-11-02 20:56:39,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:57:30,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394764725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:57:30,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:57:30,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 40 [2022-11-02 20:57:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678379233] [2022-11-02 20:57:30,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:57:30,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:57:30,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:57:30,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1732, Unknown=30, NotChecked=0, Total=1892 [2022-11-02 20:57:30,330 INFO L87 Difference]: Start difference. First operand 2197 states and 3126 transitions. Second operand has 40 states, 39 states have (on average 4.358974358974359) internal successors, (170), 30 states have internal predecessors, (170), 16 states have call successors, (44), 9 states have call predecessors, (44), 11 states have return successors, (36), 21 states have call predecessors, (36), 16 states have call successors, (36)