./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 10:52:14,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:52:14,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:52:14,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:52:14,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:52:14,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:52:14,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:52:14,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:52:14,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:52:14,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:52:14,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:52:14,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:52:14,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:52:14,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:52:14,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:52:14,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:52:14,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:52:14,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:52:14,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:52:14,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:52:14,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:52:14,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:52:14,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:52:14,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:52:14,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:52:14,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:52:14,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:52:14,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:52:14,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:52:14,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:52:14,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:52:14,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:52:14,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:52:14,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:52:14,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:52:14,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:52:14,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:52:14,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:52:14,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:52:14,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:52:14,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:52:14,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:52:14,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:52:14,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:52:14,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:52:14,598 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:52:14,598 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:52:14,599 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:52:14,599 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:52:14,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:52:14,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:52:14,600 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:52:14,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:52:14,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:52:14,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:52:14,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:52:14,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:52:14,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:52:14,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:52:14,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:52:14,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:52:14,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:52:14,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:52:14,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:52:14,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:52:14,604 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:52:14,604 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:52:14,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:52:14,604 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 89a6e0c14d7953b2e25131531535c77ad505202a25ee17b376492f1e71d3ad6d [2022-07-21 10:52:14,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:52:14,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:52:14,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:52:14,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:52:14,870 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:52:14,871 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-21 10:52:14,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c6dea50/e8315bd7f5584dd4bd87c5ac80b41f57/FLAG4e78802e4 [2022-07-21 10:52:15,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:52:15,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-21 10:52:15,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c6dea50/e8315bd7f5584dd4bd87c5ac80b41f57/FLAG4e78802e4 [2022-07-21 10:52:15,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c6dea50/e8315bd7f5584dd4bd87c5ac80b41f57 [2022-07-21 10:52:15,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:52:15,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:52:15,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:52:15,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:52:15,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:52:15,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:52:15" (1/1) ... [2022-07-21 10:52:15,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33f072d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:15, skipping insertion in model container [2022-07-21 10:52:15,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:52:15" (1/1) ... [2022-07-21 10:52:15,686 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:52:15,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:52:16,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-21 10:52:17,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:52:17,736 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:52:17,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-21 10:52:18,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:52:18,279 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:52:18,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18 WrapperNode [2022-07-21 10:52:18,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:52:18,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:52:18,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:52:18,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:52:18,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,622 INFO L137 Inliner]: procedures = 367, calls = 4074, calls flagged for inlining = 161, calls inlined = 138, statements flattened = 10019 [2022-07-21 10:52:18,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:52:18,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:52:18,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:52:18,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:52:18,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,667 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:52:18,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:52:18,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:52:18,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:52:18,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (1/1) ... [2022-07-21 10:52:18,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:52:18,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:52:18,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 10:52:19,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 10:52:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_free [2022-07-21 10:52:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_free [2022-07-21 10:52:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_mmap [2022-07-21 10:52:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_mmap [2022-07-21 10:52:19,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2022-07-21 10:52:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2022-07-21 10:52:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-21 10:52:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-21 10:52:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_compat_ioctl [2022-07-21 10:52:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_compat_ioctl [2022-07-21 10:52:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure remove_wait_queue [2022-07-21 10:52:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_wait_queue [2022-07-21 10:52:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-21 10:52:19,023 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-21 10:52:19,023 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-21 10:52:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 10:52:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 10:52:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_running [2022-07-21 10:52:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_running [2022-07-21 10:52:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_alloc [2022-07-21 10:52:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_alloc [2022-07-21 10:52:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure compat_chaninfo [2022-07-21 10:52:19,024 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_chaninfo [2022-07-21 10:52:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_cleanup [2022-07-21 10:52:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_cleanup [2022-07-21 10:52:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write_subdevice [2022-07-21 10:52:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write_subdevice [2022-07-21 10:52:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure max_write_buffer_kb_show [2022-07-21 10:52:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure max_write_buffer_kb_show [2022-07-21 10:52:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_set_subdevice_runflags [2022-07-21 10:52:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_set_subdevice_runflags [2022-07-21 10:52:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2022-07-21 10:52:19,025 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2022-07-21 10:52:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 10:52:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 10:52:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:52:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:52:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-21 10:52:19,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-21 10:52:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_read_subdevice [2022-07-21 10:52:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_read_subdevice [2022-07-21 10:52:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_free [2022-07-21 10:52:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_free [2022-07-21 10:52:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_open [2022-07-21 10:52:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_open [2022-07-21 10:52:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 10:52:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 10:52:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 10:52:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 10:52:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure compat_rangeinfo [2022-07-21 10:52:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_rangeinfo [2022-07-21 10:52:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insn [2022-07-21 10:52:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insn [2022-07-21 10:52:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insnlist [2022-07-21 10:52:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insnlist [2022-07-21 10:52:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_alloc [2022-07-21 10:52:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_alloc [2022-07-21 10:52:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2022-07-21 10:52:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_fasync [2022-07-21 10:52:19,030 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_fasync [2022-07-21 10:52:19,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 10:52:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 10:52:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure bytes_per_sample [2022-07-21 10:52:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure bytes_per_sample [2022-07-21 10:52:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-21 10:52:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-21 10:52:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 10:52:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 10:52:19,031 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_alloc_board_minor [2022-07-21 10:52:19,031 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_alloc_board_minor [2022-07-21 10:52:19,032 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-21 10:52:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-21 10:52:19,032 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_poll [2022-07-21 10:52:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_poll [2022-07-21 10:52:19,032 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_n_available [2022-07-21 10:52:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_n_available [2022-07-21 10:52:19,032 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-21 10:52:19,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-21 10:52:19,032 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-21 10:52:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-21 10:52:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-21 10:52:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-21 10:52:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_cmd [2022-07-21 10:52:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_cmd [2022-07-21 10:52:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:52:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:52:19,033 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-21 10:52:19,033 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-21 10:52:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 10:52:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 10:52:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_alloc [2022-07-21 10:52:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_alloc [2022-07-21 10:52:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-21 10:52:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-21 10:52:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-21 10:52:19,034 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-21 10:52:19,034 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_in_error [2022-07-21 10:52:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_in_error [2022-07-21 10:52:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_detach [2022-07-21 10:52:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_detach [2022-07-21 10:52:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_check_chanlist [2022-07-21 10:52:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_check_chanlist [2022-07-21 10:52:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:52:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:52:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 10:52:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 10:52:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write [2022-07-21 10:52:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write [2022-07-21 10:52:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-21 10:52:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-21 10:52:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-21 10:52:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-21 10:52:19,036 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 10:52:19,036 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 10:52:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_proc_open [2022-07-21 10:52:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_proc_open [2022-07-21 10:52:19,037 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2022-07-21 10:52:19,037 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 10:52:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-21 10:52:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-21 10:52:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure add_wait_queue [2022-07-21 10:52:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure add_wait_queue [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-21 10:52:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-21 10:52:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_postconfig [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_postconfig [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure max_read_buffer_kb_show [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure max_read_buffer_kb_show [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_free_board_dev [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_free_board_dev [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_free [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_free [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_dev_from_minor [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_dev_from_minor [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:52:19,099 INFO L130 BoogieDeclarations]: Found specification of procedure compat_alloc_user_space [2022-07-21 10:52:19,099 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_alloc_user_space [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_cleanup_board_minors [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_cleanup_board_minors [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_close [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_close [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_write_alloc [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_write_alloc [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure write_buffer_kb_show [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure write_buffer_kb_show [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmd [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmd [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:52:19,100 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 10:52:19,100 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_subdevice_from_minor [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_subdevice_from_minor [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmdtest [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmdtest [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure read_buffer_kb_show [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure read_buffer_kb_show [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure insn_rw_emulate_bits [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure insn_rw_emulate_bits [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-21 10:52:19,101 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:52:19,101 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_n_allocated [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_n_allocated [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_close [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_close [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_open [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_open [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_idle [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_idle [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure translated_ioctl [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure translated_ioctl [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-21 10:52:19,102 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-21 10:52:19,102 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure raw_ioctl [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_ioctl [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_reset [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_reset [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure resize_async_buffer [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure resize_async_buffer [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure parse_insn [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_insn [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_get_subdevice_runflags [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_get_subdevice_runflags [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure do_become_nonbusy [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure do_become_nonbusy [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_unlocked_ioctl [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_unlocked_ioctl [2022-07-21 10:52:19,103 INFO L130 BoogieDeclarations]: Found specification of procedure do_cancel [2022-07-21 10:52:19,103 INFO L138 BoogieDeclarations]: Found implementation of procedure do_cancel [2022-07-21 10:52:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_insn [2022-07-21 10:52:19,104 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_insn [2022-07-21 10:52:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:52:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtouint [2022-07-21 10:52:19,104 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtouint [2022-07-21 10:52:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:52:19,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:52:19,104 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-21 10:52:19,104 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-21 10:52:19,949 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:52:19,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:52:20,490 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 10:52:22,445 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-21 10:52:22,519 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume 0 != aref_invalid_~tmp~66#1;havoc aref_invalid_#t~nondet1322#1; [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume !(0 != aref_invalid_~tmp~66#1); [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9037: aref_invalid_#res#1 := 1;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !(0 == aref_invalid_~chanspec#1 / 16777216); [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1318#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9021: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 3 == aref_invalid_~aref~0#1; [2022-07-21 10:52:22,520 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume 0 == aref_invalid_~chanspec#1 / 16777216;aref_invalid_~aref~0#1 := 0; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume 0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576)));havoc aref_invalid_#t~mem1318#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9022: assume !(0 != (if 0 == aref_invalid_#t~mem1318#1 then 0 else (if 1 == aref_invalid_#t~mem1318#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1318#1, 1048576))));havoc aref_invalid_#t~mem1318#1; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1317#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9015: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 0 == aref_invalid_~aref~0#1; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume false;aref_invalid_~aref~0#1 := aref_invalid_~chanspec#1 / 16777216; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume !false; [2022-07-21 10:52:22,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume aref_invalid_~chanspec#1 / 16777216 >= 0;abs_9007 := (if aref_invalid_~chanspec#1 / 16777216 < 3 then aref_invalid_~chanspec#1 / 16777216 else 3);assume aref_invalid_~chanspec#1 / 16777216 >= 0;assume aref_invalid_~aref~0#1 < abs_9007; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-4: assume !(aref_invalid_~chanspec#1 / 16777216 >= 0);aref_invalid_~aref~0#1 := aref_invalid_#t~nondet1314#1;havoc aref_invalid_#t~nondet1314#1; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume false;aref_invalid_~aref~0#1 := 3; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume !false; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-6: aref_invalid_#t~switch1315#1 := 2 == aref_invalid_~aref~0#1; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume 0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152)));havoc aref_invalid_#t~mem1317#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9016: assume !(0 != (if 0 == aref_invalid_#t~mem1317#1 then 0 else (if 1 == aref_invalid_#t~mem1317#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1317#1, 2097152))));havoc aref_invalid_#t~mem1317#1; [2022-07-21 10:52:22,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9008: havoc aref_invalid_#t~switch1315#1; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume aref_invalid_#t~switch1315#1; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume !aref_invalid_#t~switch1315#1; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1316#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := aref_invalid_#t~switch1315#1 || 1 == aref_invalid_~aref~0#1; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume 0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304)));havoc aref_invalid_#t~mem1316#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9010: assume !(0 != (if 0 == aref_invalid_#t~mem1316#1 then 0 else (if 1 == aref_invalid_#t~mem1316#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1316#1, 4194304))));havoc aref_invalid_#t~mem1316#1; [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume aref_invalid_#t~switch1315#1;call aref_invalid_#t~mem1319#1 := read~int(aref_invalid_~s#1.base, 20 + aref_invalid_~s#1.offset, 4); [2022-07-21 10:52:22,523 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := true; [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044: SUMMARY for call aref_invalid_#t~ret1321#1 := ldv__builtin_expect(aref_invalid_#t~mem1320#1 % 256, 0); srcloc: null [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9044-1: assume -9223372036854775808 <= aref_invalid_#t~ret1321#1 && aref_invalid_#t~ret1321#1 <= 9223372036854775807;aref_invalid_~tmp~66#1 := aref_invalid_#t~ret1321#1;havoc aref_invalid_#t~mem1320#1;havoc aref_invalid_#t~ret1321#1; [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume 0 != ~comedi_debug~0;call write~$Pointer$(302, 0, aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(303, 0, aref_invalid_~#descriptor~14#1.base, 8 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(304, 0, aref_invalid_~#descriptor~14#1.base, 16 + aref_invalid_~#descriptor~14#1.offset, 8);call write~$Pointer$(305, 0, aref_invalid_~#descriptor~14#1.base, 24 + aref_invalid_~#descriptor~14#1.offset, 8);call write~int(168, aref_invalid_~#descriptor~14#1.base, 32 + aref_invalid_~#descriptor~14#1.offset, 4);call write~int(0, aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1);call aref_invalid_#t~mem1320#1 := read~int(aref_invalid_~#descriptor~14#1.base, 36 + aref_invalid_~#descriptor~14#1.offset, 1); [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume !(0 != ~comedi_debug~0); [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume 0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608)));havoc aref_invalid_#t~mem1319#1;aref_invalid_#res#1 := 0;call ULTIMATE.dealloc(aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset);havoc aref_invalid_~#descriptor~14#1.base, aref_invalid_~#descriptor~14#1.offset; [2022-07-21 10:52:22,524 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9028: assume !(0 != (if 0 == aref_invalid_#t~mem1319#1 then 0 else (if 1 == aref_invalid_#t~mem1319#1 then 0 else ~bitwiseAnd(aref_invalid_#t~mem1319#1, 8388608))));havoc aref_invalid_#t~mem1319#1; [2022-07-21 10:52:30,352 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:52:30,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:52:30,377 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 10:52:30,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:52:30 BoogieIcfgContainer [2022-07-21 10:52:30,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:52:30,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:52:30,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:52:30,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:52:30,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:52:15" (1/3) ... [2022-07-21 10:52:30,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdeef7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:52:30, skipping insertion in model container [2022-07-21 10:52:30,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:52:18" (2/3) ... [2022-07-21 10:52:30,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fdeef7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:52:30, skipping insertion in model container [2022-07-21 10:52:30,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:52:30" (3/3) ... [2022-07-21 10:52:30,388 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i [2022-07-21 10:52:30,397 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:52:30,398 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:52:30,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:52:30,478 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@559a7d04, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d1286dd [2022-07-21 10:52:30,479 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:52:30,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) [2022-07-21 10:52:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 10:52:30,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:30,514 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:52:30,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash -113660622, now seen corresponding path program 1 times [2022-07-21 10:52:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:30,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440121676] [2022-07-21 10:52:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:30,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:52:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:52:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:52:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:52:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:52:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:52:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:52:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:52:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:52:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:52:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:52:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:52:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:52:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-21 10:52:31,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:31,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440121676] [2022-07-21 10:52:31,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440121676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:31,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:31,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:52:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107831914] [2022-07-21 10:52:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:31,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:52:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:52:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:52:31,159 INFO L87 Difference]: Start difference. First operand has 3812 states, 3098 states have (on average 1.554228534538412) internal successors, (4815), 3121 states have internal predecessors, (4815), 600 states have call successors, (600), 113 states have call predecessors, (600), 112 states have return successors, (591), 590 states have call predecessors, (591), 591 states have call successors, (591) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 10:52:38,729 WARN L534 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-07-21 10:52:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:38,915 INFO L93 Difference]: Finished difference Result 7835 states and 12526 transitions. [2022-07-21 10:52:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 10:52:38,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 106 [2022-07-21 10:52:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:38,954 INFO L225 Difference]: With dead ends: 7835 [2022-07-21 10:52:38,954 INFO L226 Difference]: Without dead ends: 4002 [2022-07-21 10:52:38,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:52:38,976 INFO L413 NwaCegarLoop]: 5817 mSDtfsCounter, 6299 mSDsluCounter, 3591 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 980 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6700 SdHoareTripleChecker+Valid, 9408 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:38,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6700 Valid, 9408 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 1362 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 10:52:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-21 10:52:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3788. [2022-07-21 10:52:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3085 states have (on average 1.5319286871961102) internal successors, (4726), 3097 states have internal predecessors, (4726), 591 states have call successors, (591), 112 states have call predecessors, (591), 111 states have return successors, (589), 588 states have call predecessors, (589), 589 states have call successors, (589) [2022-07-21 10:52:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5906 transitions. [2022-07-21 10:52:39,179 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5906 transitions. Word has length 106 [2022-07-21 10:52:39,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:39,182 INFO L495 AbstractCegarLoop]: Abstraction has 3788 states and 5906 transitions. [2022-07-21 10:52:39,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 10:52:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5906 transitions. [2022-07-21 10:52:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 10:52:39,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:39,187 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:52:39,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:52:39,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 249698647, now seen corresponding path program 1 times [2022-07-21 10:52:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:39,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257027377] [2022-07-21 10:52:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:52:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:52:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:52:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:52:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:52:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:52:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:52:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:52:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:52:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:52:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:52:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:52:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:52:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-21 10:52:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257027377] [2022-07-21 10:52:39,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257027377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:39,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:39,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:52:39,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75657261] [2022-07-21 10:52:39,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:52:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:52:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:52:39,622 INFO L87 Difference]: Start difference. First operand 3788 states and 5906 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 10:52:44,897 WARN L534 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-07-21 10:52:51,409 WARN L534 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-07-21 10:52:53,766 WARN L534 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-07-21 10:52:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:53,878 INFO L93 Difference]: Finished difference Result 11728 states and 18438 transitions. [2022-07-21 10:52:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:52:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2022-07-21 10:52:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:53,926 INFO L225 Difference]: With dead ends: 11728 [2022-07-21 10:52:53,926 INFO L226 Difference]: Without dead ends: 7949 [2022-07-21 10:52:53,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:52:53,947 INFO L413 NwaCegarLoop]: 6355 mSDtfsCounter, 7007 mSDsluCounter, 8633 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 1607 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7465 SdHoareTripleChecker+Valid, 14988 SdHoareTripleChecker+Invalid, 4558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:53,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7465 Valid, 14988 Invalid, 4558 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1607 Valid, 2948 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2022-07-21 10:52:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2022-07-21 10:52:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7578. [2022-07-21 10:52:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 6181 states have (on average 1.5337324057595858) internal successors, (9480), 6205 states have internal predecessors, (9480), 1165 states have call successors, (1165), 223 states have call predecessors, (1165), 231 states have return successors, (1229), 1169 states have call predecessors, (1229), 1162 states have call successors, (1229) [2022-07-21 10:52:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11874 transitions. [2022-07-21 10:52:54,166 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11874 transitions. Word has length 108 [2022-07-21 10:52:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:54,166 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 11874 transitions. [2022-07-21 10:52:54,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 10:52:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11874 transitions. [2022-07-21 10:52:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 10:52:54,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:54,172 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:52:54,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:52:54,172 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1851708862, now seen corresponding path program 1 times [2022-07-21 10:52:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801749154] [2022-07-21 10:52:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:52:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:52:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:52:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:52:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:52:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:52:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:52:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:52:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:52:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:52:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:52:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:52:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:52:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-21 10:52:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:52:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:52:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:52:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:52:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:52:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-21 10:52:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801749154] [2022-07-21 10:52:54,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801749154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:54,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:54,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:52:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572906860] [2022-07-21 10:52:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:54,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:52:54,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:54,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:52:54,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:52:54,468 INFO L87 Difference]: Start difference. First operand 7578 states and 11874 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 10:52:59,424 WARN L534 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-07-21 10:53:03,637 WARN L534 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-07-21 10:53:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:03,814 INFO L93 Difference]: Finished difference Result 16967 states and 26412 transitions. [2022-07-21 10:53:03,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:53:03,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2022-07-21 10:53:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:03,861 INFO L225 Difference]: With dead ends: 16967 [2022-07-21 10:53:03,861 INFO L226 Difference]: Without dead ends: 9416 [2022-07-21 10:53:03,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:53:03,890 INFO L413 NwaCegarLoop]: 5973 mSDtfsCounter, 1942 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 886 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 14470 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:03,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 14470 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 2521 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2022-07-21 10:53:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2022-07-21 10:53:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 8930. [2022-07-21 10:53:04,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 7210 states have (on average 1.510124826629681) internal successors, (10888), 7241 states have internal predecessors, (10888), 1416 states have call successors, (1416), 296 states have call predecessors, (1416), 303 states have return successors, (1479), 1416 states have call predecessors, (1479), 1412 states have call successors, (1479) [2022-07-21 10:53:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13783 transitions. [2022-07-21 10:53:04,138 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13783 transitions. Word has length 151 [2022-07-21 10:53:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:04,139 INFO L495 AbstractCegarLoop]: Abstraction has 8930 states and 13783 transitions. [2022-07-21 10:53:04,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 10:53:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13783 transitions. [2022-07-21 10:53:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 10:53:04,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:04,144 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:53:04,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:53:04,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash 769983256, now seen corresponding path program 1 times [2022-07-21 10:53:04,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:04,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175946933] [2022-07-21 10:53:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 10:53:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 10:53:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 10:53:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:53:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 10:53:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:53:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-07-21 10:53:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:04,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175946933] [2022-07-21 10:53:04,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175946933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:04,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:04,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 10:53:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402878341] [2022-07-21 10:53:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:04,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:53:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:53:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:53:04,474 INFO L87 Difference]: Start difference. First operand 8930 states and 13783 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 10:53:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:11,328 INFO L93 Difference]: Finished difference Result 27721 states and 42979 transitions. [2022-07-21 10:53:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:53:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2022-07-21 10:53:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:11,415 INFO L225 Difference]: With dead ends: 27721 [2022-07-21 10:53:11,415 INFO L226 Difference]: Without dead ends: 18816 [2022-07-21 10:53:11,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:53:11,445 INFO L413 NwaCegarLoop]: 6203 mSDtfsCounter, 10427 mSDsluCounter, 8662 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 4561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10955 SdHoareTripleChecker+Valid, 14865 SdHoareTripleChecker+Invalid, 7596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4561 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:11,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10955 Valid, 14865 Invalid, 7596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4561 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-21 10:53:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2022-07-21 10:53:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 17319. [2022-07-21 10:53:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17319 states, 14066 states have (on average 1.5177733541874023) internal successors, (21349), 14119 states have internal predecessors, (21349), 2672 states have call successors, (2672), 561 states have call predecessors, (2672), 580 states have return successors, (2819), 2682 states have call predecessors, (2819), 2668 states have call successors, (2819) [2022-07-21 10:53:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 26840 transitions. [2022-07-21 10:53:11,935 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 26840 transitions. Word has length 157 [2022-07-21 10:53:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:11,937 INFO L495 AbstractCegarLoop]: Abstraction has 17319 states and 26840 transitions. [2022-07-21 10:53:11,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 10:53:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 26840 transitions. [2022-07-21 10:53:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-21 10:53:11,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:11,944 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:53:11,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:53:11,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -937695385, now seen corresponding path program 1 times [2022-07-21 10:53:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885334188] [2022-07-21 10:53:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:53:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:53:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:53:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 10:53:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 10:53:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:53:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 10:53:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-07-21 10:53:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:12,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885334188] [2022-07-21 10:53:12,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885334188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:12,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:12,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:53:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118732581] [2022-07-21 10:53:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:12,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:53:12,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:12,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:53:12,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:53:12,285 INFO L87 Difference]: Start difference. First operand 17319 states and 26840 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 10:53:16,987 WARN L534 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-07-21 10:53:20,778 WARN L534 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-07-21 10:53:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:20,971 INFO L93 Difference]: Finished difference Result 28028 states and 43168 transitions. [2022-07-21 10:53:20,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:53:20,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2022-07-21 10:53:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:21,019 INFO L225 Difference]: With dead ends: 28028 [2022-07-21 10:53:21,020 INFO L226 Difference]: Without dead ends: 10740 [2022-07-21 10:53:21,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:53:21,066 INFO L413 NwaCegarLoop]: 5749 mSDtfsCounter, 6315 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 983 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6732 SdHoareTripleChecker+Valid, 9321 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:21,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6732 Valid, 9321 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-07-21 10:53:21,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2022-07-21 10:53:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10086. [2022-07-21 10:53:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10086 states, 8081 states have (on average 1.4892958792228685) internal successors, (12035), 8117 states have internal predecessors, (12035), 1620 states have call successors, (1620), 376 states have call predecessors, (1620), 384 states have return successors, (1690), 1620 states have call predecessors, (1690), 1616 states have call successors, (1690) [2022-07-21 10:53:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 15345 transitions. [2022-07-21 10:53:21,361 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 15345 transitions. Word has length 191 [2022-07-21 10:53:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:21,362 INFO L495 AbstractCegarLoop]: Abstraction has 10086 states and 15345 transitions. [2022-07-21 10:53:21,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (26), 3 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 10:53:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 15345 transitions. [2022-07-21 10:53:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-21 10:53:21,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:21,372 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:53:21,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:53:21,372 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:21,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1170401307, now seen corresponding path program 1 times [2022-07-21 10:53:21,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:21,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100979490] [2022-07-21 10:53:21,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:21,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 10:53:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:53:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 10:53:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 10:53:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 10:53:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 10:53:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-21 10:53:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 10:53:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 10:53:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 10:53:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 10:53:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-21 10:53:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 10:53:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-21 10:53:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:53:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1025 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2022-07-21 10:53:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:21,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100979490] [2022-07-21 10:53:21,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100979490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:21,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:21,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:53:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511419097] [2022-07-21 10:53:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:21,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:53:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:21,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:53:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:53:21,731 INFO L87 Difference]: Start difference. First operand 10086 states and 15345 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 10:53:29,547 WARN L534 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-07-21 10:53:31,576 WARN L534 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-07-21 10:53:38,270 WARN L534 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-07-21 10:53:40,300 WARN L534 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-07-21 10:53:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:40,679 INFO L93 Difference]: Finished difference Result 20724 states and 31634 transitions. [2022-07-21 10:53:40,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 10:53:40,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 234 [2022-07-21 10:53:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:40,722 INFO L225 Difference]: With dead ends: 20724 [2022-07-21 10:53:40,722 INFO L226 Difference]: Without dead ends: 11190 [2022-07-21 10:53:40,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:53:40,751 INFO L413 NwaCegarLoop]: 5717 mSDtfsCounter, 1012 mSDsluCounter, 18909 mSDsCounter, 0 mSdLazyCounter, 7439 mSolverCounterSat, 690 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 24626 SdHoareTripleChecker+Invalid, 8133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 7439 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:40,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 24626 Invalid, 8133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 7439 Invalid, 4 Unknown, 0 Unchecked, 18.5s Time] [2022-07-21 10:53:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2022-07-21 10:53:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10077. [2022-07-21 10:53:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10077 states, 8074 states have (on average 1.4892246717859796) internal successors, (12024), 8110 states have internal predecessors, (12024), 1619 states have call successors, (1619), 375 states have call predecessors, (1619), 383 states have return successors, (1689), 1619 states have call predecessors, (1689), 1615 states have call successors, (1689) [2022-07-21 10:53:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 15332 transitions. [2022-07-21 10:53:41,105 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 15332 transitions. Word has length 234 [2022-07-21 10:53:41,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:41,106 INFO L495 AbstractCegarLoop]: Abstraction has 10077 states and 15332 transitions. [2022-07-21 10:53:41,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (34), 5 states have call predecessors, (34), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 10:53:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 15332 transitions. [2022-07-21 10:53:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-21 10:53:41,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:41,112 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:53:41,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:53:41,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 169165785, now seen corresponding path program 1 times [2022-07-21 10:53:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:41,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649806761] [2022-07-21 10:53:41,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:41,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:53:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:53:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:53:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:53:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:53:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 10:53:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 10:53:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 10:53:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-21 10:53:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 10:53:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 10:53:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 10:53:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:53:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:53:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2022-07-21 10:53:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:41,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649806761] [2022-07-21 10:53:41,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649806761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:41,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:41,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 10:53:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232802333] [2022-07-21 10:53:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:41,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 10:53:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 10:53:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:53:41,598 INFO L87 Difference]: Start difference. First operand 10077 states and 15332 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 10:53:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:47,399 INFO L93 Difference]: Finished difference Result 20201 states and 31043 transitions. [2022-07-21 10:53:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:53:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 249 [2022-07-21 10:53:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:47,438 INFO L225 Difference]: With dead ends: 20201 [2022-07-21 10:53:47,438 INFO L226 Difference]: Without dead ends: 10685 [2022-07-21 10:53:47,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:53:47,464 INFO L413 NwaCegarLoop]: 5833 mSDtfsCounter, 8415 mSDsluCounter, 12168 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 2727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8909 SdHoareTripleChecker+Valid, 18001 SdHoareTripleChecker+Invalid, 6625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2727 IncrementalHoareTripleChecker+Valid, 3898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:47,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8909 Valid, 18001 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2727 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-21 10:53:47,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-07-21 10:53:47,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 9427. [2022-07-21 10:53:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9427 states, 7607 states have (on average 1.5028263441566978) internal successors, (11432), 7638 states have internal predecessors, (11432), 1483 states have call successors, (1483), 327 states have call predecessors, (1483), 336 states have return successors, (1556), 1485 states have call predecessors, (1556), 1479 states have call successors, (1556) [2022-07-21 10:53:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14471 transitions. [2022-07-21 10:53:47,735 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14471 transitions. Word has length 249 [2022-07-21 10:53:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:47,736 INFO L495 AbstractCegarLoop]: Abstraction has 9427 states and 14471 transitions. [2022-07-21 10:53:47,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 4 states have internal predecessors, (116), 3 states have call successors, (38), 7 states have call predecessors, (38), 1 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 10:53:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14471 transitions. [2022-07-21 10:53:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-21 10:53:47,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:47,747 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:53:47,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:53:47,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:47,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:47,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1271706461, now seen corresponding path program 1 times [2022-07-21 10:53:47,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:47,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163792465] [2022-07-21 10:53:47,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:47,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:53:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:53:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:53:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:53:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:53:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:53:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:53:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:53:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:53:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:53:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:53:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:53:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:53:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:53:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 10:53:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-21 10:53:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:53:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 10:53:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2022-07-21 10:53:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:48,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163792465] [2022-07-21 10:53:48,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163792465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:48,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:48,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:53:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642541494] [2022-07-21 10:53:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:48,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:53:48,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:53:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:53:48,169 INFO L87 Difference]: Start difference. First operand 9427 states and 14471 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-21 10:53:54,324 WARN L534 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-07-21 10:53:58,751 WARN L534 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-07-21 10:53:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:59,196 INFO L93 Difference]: Finished difference Result 21600 states and 32975 transitions. [2022-07-21 10:53:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:53:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 273 [2022-07-21 10:53:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:59,240 INFO L225 Difference]: With dead ends: 21600 [2022-07-21 10:53:59,240 INFO L226 Difference]: Without dead ends: 12734 [2022-07-21 10:53:59,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:53:59,266 INFO L413 NwaCegarLoop]: 6502 mSDtfsCounter, 2618 mSDsluCounter, 12792 mSDsCounter, 0 mSdLazyCounter, 3780 mSolverCounterSat, 1136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 19294 SdHoareTripleChecker+Invalid, 4918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3780 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:59,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 19294 Invalid, 4918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 3780 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2022-07-21 10:53:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2022-07-21 10:53:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 11694. [2022-07-21 10:53:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11694 states, 9306 states have (on average 1.478508489146787) internal successors, (13759), 9348 states have internal predecessors, (13759), 1913 states have call successors, (1913), 465 states have call predecessors, (1913), 474 states have return successors, (1987), 1912 states have call predecessors, (1987), 1908 states have call successors, (1987) [2022-07-21 10:53:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17659 transitions. [2022-07-21 10:53:59,586 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17659 transitions. Word has length 273 [2022-07-21 10:53:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:59,586 INFO L495 AbstractCegarLoop]: Abstraction has 11694 states and 17659 transitions. [2022-07-21 10:53:59,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (38), 4 states have call predecessors, (38), 1 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-21 10:53:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17659 transitions. [2022-07-21 10:53:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-21 10:53:59,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:59,595 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:53:59,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:53:59,595 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 78876558, now seen corresponding path program 1 times [2022-07-21 10:53:59,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398286112] [2022-07-21 10:53:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:53:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:53:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:53:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:53:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:53:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:53:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:53:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:53:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:53:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:53:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:53:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:53:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:53:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:53:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:53:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:54:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:54:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:54:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:54:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:54:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:54:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:54:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:54:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:54:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:54:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:54:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:54:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:54:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:54:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:54:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 10:54:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-21 10:54:00,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:00,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398286112] [2022-07-21 10:54:00,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398286112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:00,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:54:00,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 10:54:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067141860] [2022-07-21 10:54:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:00,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:54:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:54:00,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:54:00,122 INFO L87 Difference]: Start difference. First operand 11694 states and 17659 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-21 10:54:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:54:10,642 INFO L93 Difference]: Finished difference Result 18810 states and 28593 transitions. [2022-07-21 10:54:10,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 10:54:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 277 [2022-07-21 10:54:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:54:10,694 INFO L225 Difference]: With dead ends: 18810 [2022-07-21 10:54:10,694 INFO L226 Difference]: Without dead ends: 18807 [2022-07-21 10:54:10,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:54:10,704 INFO L413 NwaCegarLoop]: 11780 mSDtfsCounter, 15931 mSDsluCounter, 16671 mSDsCounter, 0 mSdLazyCounter, 7144 mSolverCounterSat, 5005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16773 SdHoareTripleChecker+Valid, 28451 SdHoareTripleChecker+Invalid, 12149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5005 IncrementalHoareTripleChecker+Valid, 7144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:54:10,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16773 Valid, 28451 Invalid, 12149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5005 Valid, 7144 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-07-21 10:54:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2022-07-21 10:54:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17370. [2022-07-21 10:54:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17370 states, 13821 states have (on average 1.4789089067361263) internal successors, (20440), 13890 states have internal predecessors, (20440), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-21 10:54:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 26346 transitions. [2022-07-21 10:54:11,233 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 26346 transitions. Word has length 277 [2022-07-21 10:54:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:54:11,234 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 26346 transitions. [2022-07-21 10:54:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 4 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-21 10:54:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 26346 transitions. [2022-07-21 10:54:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-21 10:54:11,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:54:11,241 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:54:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 10:54:11,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:54:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:54:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1509471344, now seen corresponding path program 1 times [2022-07-21 10:54:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:54:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750189692] [2022-07-21 10:54:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:11,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:54:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:54:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:54:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:54:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:54:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:54:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:54:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:54:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:54:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:54:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:54:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:54:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:54:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:54:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:54:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:54:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:54:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:54:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:54:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:54:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:54:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:54:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:54:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:54:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:54:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:54:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:54:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:54:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:54:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:12,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:12,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:54:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 10:54:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2022-07-21 10:54:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750189692] [2022-07-21 10:54:12,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750189692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:54:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59719676] [2022-07-21 10:54:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:12,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:54:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:54:12,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 10:54:12,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 10:54:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:13,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 4904 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 10:54:13,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:54:13,453 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 22 treesize of output 10 [2022-07-21 10:54:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-21 10:54:13,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 10:54:13,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59719676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:13,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 10:54:13,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-21 10:54:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806502952] [2022-07-21 10:54:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:13,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:54:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:54:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2022-07-21 10:54:13,512 INFO L87 Difference]: Start difference. First operand 17370 states and 26346 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 10:54:18,982 WARN L534 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-07-21 10:54:22,548 WARN L534 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-07-21 10:54:24,583 WARN L534 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-07-21 10:54:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:54:24,820 INFO L93 Difference]: Finished difference Result 34371 states and 52374 transitions. [2022-07-21 10:54:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:54:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 277 [2022-07-21 10:54:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:54:24,879 INFO L225 Difference]: With dead ends: 34371 [2022-07-21 10:54:24,879 INFO L226 Difference]: Without dead ends: 17562 [2022-07-21 10:54:24,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-21 10:54:24,911 INFO L413 NwaCegarLoop]: 5818 mSDtfsCounter, 26 mSDsluCounter, 16529 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22347 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:54:24,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22347 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 952 Invalid, 3 Unknown, 0 Unchecked, 10.8s Time] [2022-07-21 10:54:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2022-07-21 10:54:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 17400. [2022-07-21 10:54:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17400 states, 13851 states have (on average 1.4783048155367844) internal successors, (20476), 13920 states have internal predecessors, (20476), 2835 states have call successors, (2835), 682 states have call predecessors, (2835), 713 states have return successors, (3071), 2842 states have call predecessors, (3071), 2830 states have call successors, (3071) [2022-07-21 10:54:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 26382 transitions. [2022-07-21 10:54:25,464 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 26382 transitions. Word has length 277 [2022-07-21 10:54:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:54:25,465 INFO L495 AbstractCegarLoop]: Abstraction has 17400 states and 26382 transitions. [2022-07-21 10:54:25,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 10:54:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 26382 transitions. [2022-07-21 10:54:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-21 10:54:25,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:54:25,473 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:54:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 10:54:25,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 10:54:25,688 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:54:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:54:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash -459269918, now seen corresponding path program 1 times [2022-07-21 10:54:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:54:25,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5586821] [2022-07-21 10:54:25,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:25,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:54:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:54:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:54:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:54:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:54:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:54:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:54:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:54:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:54:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:54:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:54:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:54:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:54:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:54:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:54:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:54:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:54:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:54:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:54:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:54:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:54:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:54:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:54:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:54:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:54:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:54:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:54:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:54:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:54:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:54:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 10:54:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-21 10:54:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-21 10:54:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5586821] [2022-07-21 10:54:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5586821] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:26,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:54:26,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 10:54:26,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493132777] [2022-07-21 10:54:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:54:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:54:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:54:26,112 INFO L87 Difference]: Start difference. First operand 17400 states and 26382 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-21 10:54:33,625 WARN L534 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-07-21 10:54:40,426 WARN L534 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-07-21 10:54:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:54:41,197 INFO L93 Difference]: Finished difference Result 37107 states and 56836 transitions. [2022-07-21 10:54:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:54:41,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 279 [2022-07-21 10:54:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:54:41,283 INFO L225 Difference]: With dead ends: 37107 [2022-07-21 10:54:41,283 INFO L226 Difference]: Without dead ends: 20268 [2022-07-21 10:54:41,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:54:41,329 INFO L413 NwaCegarLoop]: 5398 mSDtfsCounter, 5489 mSDsluCounter, 8512 mSDsCounter, 0 mSdLazyCounter, 9006 mSolverCounterSat, 1760 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 10768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1760 IncrementalHoareTripleChecker+Valid, 9006 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:54:41,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 13910 Invalid, 10768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1760 Valid, 9006 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2022-07-21 10:54:41,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2022-07-21 10:54:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 18512. [2022-07-21 10:54:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18512 states, 14843 states have (on average 1.4852118843899482) internal successors, (22045), 14902 states have internal predecessors, (22045), 2931 states have call successors, (2931), 682 states have call predecessors, (2931), 737 states have return successors, (3270), 2975 states have call predecessors, (3270), 2926 states have call successors, (3270) [2022-07-21 10:54:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 28246 transitions. [2022-07-21 10:54:41,984 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 28246 transitions. Word has length 279 [2022-07-21 10:54:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:54:41,984 INFO L495 AbstractCegarLoop]: Abstraction has 18512 states and 28246 transitions. [2022-07-21 10:54:41,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (39), 5 states have call predecessors, (39), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-21 10:54:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 28246 transitions. [2022-07-21 10:54:41,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-21 10:54:41,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:54:41,992 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:54:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 10:54:41,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:54:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:54:41,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1268616544, now seen corresponding path program 1 times [2022-07-21 10:54:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:54:41,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6259795] [2022-07-21 10:54:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:54:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:54:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:54:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:54:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:54:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:54:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:54:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:54:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:54:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:54:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:54:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:54:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:54:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:54:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:54:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:54:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:54:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:54:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:54:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:54:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:54:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:54:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:54:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:54:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:54:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:54:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:54:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:54:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:54:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:54:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:54:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 10:54:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-21 10:54:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-21 10:54:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2022-07-21 10:54:42,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:42,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6259795] [2022-07-21 10:54:42,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6259795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:42,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:54:42,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 10:54:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948792963] [2022-07-21 10:54:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:42,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 10:54:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 10:54:42,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:54:42,370 INFO L87 Difference]: Start difference. First operand 18512 states and 28246 transitions. Second operand has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 10:54:57,304 WARN L534 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-07-21 10:55:19,941 WARN L534 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-07-21 10:55:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:24,657 INFO L93 Difference]: Finished difference Result 51859 states and 80071 transitions. [2022-07-21 10:55:24,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 10:55:24,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 279 [2022-07-21 10:55:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:24,773 INFO L225 Difference]: With dead ends: 51859 [2022-07-21 10:55:24,774 INFO L226 Difference]: Without dead ends: 39401 [2022-07-21 10:55:24,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-07-21 10:55:24,816 INFO L413 NwaCegarLoop]: 10810 mSDtfsCounter, 11318 mSDsluCounter, 37030 mSDsCounter, 0 mSdLazyCounter, 40159 mSolverCounterSat, 3629 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11848 SdHoareTripleChecker+Valid, 47840 SdHoareTripleChecker+Invalid, 43790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3629 IncrementalHoareTripleChecker+Valid, 40159 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:24,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11848 Valid, 47840 Invalid, 43790 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3629 Valid, 40159 Invalid, 2 Unknown, 0 Unchecked, 40.8s Time] [2022-07-21 10:55:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-07-21 10:55:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 36439. [2022-07-21 10:55:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36439 states, 29238 states have (on average 1.4873452356522334) internal successors, (43487), 29355 states have internal predecessors, (43487), 5721 states have call successors, (5721), 1338 states have call predecessors, (5721), 1479 states have return successors, (6732), 5841 states have call predecessors, (6732), 5713 states have call successors, (6732) [2022-07-21 10:55:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 55940 transitions. [2022-07-21 10:55:25,995 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 55940 transitions. Word has length 279 [2022-07-21 10:55:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:25,995 INFO L495 AbstractCegarLoop]: Abstraction has 36439 states and 55940 transitions. [2022-07-21 10:55:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.444444444444445) internal successors, (121), 6 states have internal predecessors, (121), 4 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 10:55:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 55940 transitions. [2022-07-21 10:55:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-21 10:55:26,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:26,003 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-21 10:55:26,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 10:55:26,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 634260467, now seen corresponding path program 1 times [2022-07-21 10:55:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:26,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650942151] [2022-07-21 10:55:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 10:55:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-21 10:55:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 10:55:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:55:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:55:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:55:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:55:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:55:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 10:55:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 10:55:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-21 10:55:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:55:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 10:55:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-21 10:55:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:55:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 10:55:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 10:55:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 10:55:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:55:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 10:55:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 10:55:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 10:55:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 10:55:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 10:55:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 10:55:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-21 10:55:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 10:55:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:55:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:55:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-21 10:55:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-21 10:55:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-21 10:55:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-21 10:55:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 10:55:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2022-07-21 10:55:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:26,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650942151] [2022-07-21 10:55:26,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650942151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:55:26,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11031164] [2022-07-21 10:55:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:55:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:55:26,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 10:55:26,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 10:55:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:27,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 10:55:27,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:55:28,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,030 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 10:55:28,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-21 10:55:28,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,054 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 10:55:28,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 21 [2022-07-21 10:55:28,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,827 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-07-21 10:55:28,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:28,832 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-07-21 10:55:29,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:29,061 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 20 treesize of output 20 [2022-07-21 10:55:29,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 10:55:29,066 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 20 treesize of output 20 [2022-07-21 10:55:29,484 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 27 treesize of output 21 [2022-07-21 10:55:29,487 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 20 treesize of output 16 [2022-07-21 10:55:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 3 proven. 591 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-07-21 10:55:29,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 10:55:39,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11031164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:55:39,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 10:55:39,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 24 [2022-07-21 10:55:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232974357] [2022-07-21 10:55:39,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 10:55:39,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 10:55:39,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:39,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 10:55:39,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-21 10:55:39,868 INFO L87 Difference]: Start difference. First operand 36439 states and 55940 transitions. Second operand has 24 states, 23 states have (on average 10.478260869565217) internal successors, (241), 17 states have internal predecessors, (241), 11 states have call successors, (75), 11 states have call predecessors, (75), 7 states have return successors, (69), 12 states have call predecessors, (69), 10 states have call successors, (69) [2022-07-21 10:55:59,404 WARN L534 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-07-21 10:56:00,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:56:02,916 WARN L534 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-07-21 10:56:08,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:56:10,924 WARN L534 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-07-21 10:56:12,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:56:14,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []