./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 eb692b52 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-?-eb692b5 [2022-07-19 23:21:05,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:21:05,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:21:05,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:21:05,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:21:05,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:21:05,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:21:05,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:21:05,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:21:05,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:21:05,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:21:05,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:21:05,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:21:05,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:21:05,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:21:05,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:21:05,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:21:05,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:21:05,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:21:05,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:21:05,762 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:21:05,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:21:05,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:21:05,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:21:05,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:21:05,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:21:05,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:21:05,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:21:05,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:21:05,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:21:05,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:21:05,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:21:05,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:21:05,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:21:05,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:21:05,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:21:05,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:21:05,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:21:05,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:21:05,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:21:05,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:21:05,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:21:05,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:21:05,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:21:05,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:21:05,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:21:05,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:21:05,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:21:05,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:21:05,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:21:05,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:21:05,801 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:21:05,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:21:05,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:21:05,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:21:05,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:21:05,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:21:05,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:21:05,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:21:05,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:21:05,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:21:05,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:21:05,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:21:05,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:21:05,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:21:05,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:21:05,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:21:05,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:21:05,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:21:05,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:21:05,805 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:21:05,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:21:05,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:21:05,806 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-19 23:21:06,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:21:06,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:21:06,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:21:06,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:21:06,051 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:21:06,053 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-19 23:21:06,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00eedd07e/f642865b1db140569eeb1488af036ad5/FLAG8fbd93bad [2022-07-19 23:21:06,909 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:21:06,910 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-19 23:21:06,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00eedd07e/f642865b1db140569eeb1488af036ad5/FLAG8fbd93bad [2022-07-19 23:21:07,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00eedd07e/f642865b1db140569eeb1488af036ad5 [2022-07-19 23:21:07,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:21:07,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:21:07,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:21:07,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:21:07,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:21:07,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:21:07" (1/1) ... [2022-07-19 23:21:07,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d43e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:07, skipping insertion in model container [2022-07-19 23:21:07,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:21:07" (1/1) ... [2022-07-19 23:21:07,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:21:07,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:21:08,207 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-19 23:21:09,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:21:09,772 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:21:09,861 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-19 23:21:10,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:21:10,360 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:21:10,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10 WrapperNode [2022-07-19 23:21:10,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:21:10,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:21:10,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:21:10,364 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:21:10,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:10,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:10,850 INFO L137 Inliner]: procedures = 367, calls = 4074, calls flagged for inlining = 161, calls inlined = 138, statements flattened = 10019 [2022-07-19 23:21:10,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:21:10,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:21:10,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:21:10,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:21:10,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:10,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:10,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:10,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:11,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:11,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:11,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:11,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:21:11,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:21:11,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:21:11,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:21:11,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (1/1) ... [2022-07-19 23:21:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:21:11,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:21:11,532 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-19 23:21:11,588 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-19 23:21:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_free [2022-07-19 23:21:11,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_free [2022-07-19 23:21:11,606 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_mmap [2022-07-19 23:21:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_mmap [2022-07-19 23:21:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2022-07-19 23:21:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2022-07-19 23:21:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-19 23:21:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-19 23:21:11,607 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_compat_ioctl [2022-07-19 23:21:11,607 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_compat_ioctl [2022-07-19 23:21:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure remove_wait_queue [2022-07-19 23:21:11,608 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_wait_queue [2022-07-19 23:21:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-19 23:21:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-19 23:21:11,608 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-19 23:21:11,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:21:11,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:21:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_running [2022-07-19 23:21:11,609 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_running [2022-07-19 23:21:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_alloc [2022-07-19 23:21:11,609 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_alloc [2022-07-19 23:21:11,609 INFO L130 BoogieDeclarations]: Found specification of procedure compat_chaninfo [2022-07-19 23:21:11,610 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_chaninfo [2022-07-19 23:21:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_cleanup [2022-07-19 23:21:11,610 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_cleanup [2022-07-19 23:21:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write_subdevice [2022-07-19 23:21:11,610 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write_subdevice [2022-07-19 23:21:11,610 INFO L130 BoogieDeclarations]: Found specification of procedure max_write_buffer_kb_show [2022-07-19 23:21:11,611 INFO L138 BoogieDeclarations]: Found implementation of procedure max_write_buffer_kb_show [2022-07-19 23:21:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_set_subdevice_runflags [2022-07-19 23:21:11,611 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_set_subdevice_runflags [2022-07-19 23:21:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2022-07-19 23:21:11,611 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2022-07-19 23:21:11,611 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-19 23:21:11,612 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-19 23:21:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:21:11,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:21:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-19 23:21:11,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-19 23:21:11,612 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_read_subdevice [2022-07-19 23:21:11,613 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_read_subdevice [2022-07-19 23:21:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_free [2022-07-19 23:21:11,613 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_free [2022-07-19 23:21:11,613 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_open [2022-07-19 23:21:11,614 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_open [2022-07-19 23:21:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-19 23:21:11,614 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-19 23:21:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:21:11,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:21:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure compat_rangeinfo [2022-07-19 23:21:11,615 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_rangeinfo [2022-07-19 23:21:11,615 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insn [2022-07-19 23:21:11,615 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insn [2022-07-19 23:21:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insnlist [2022-07-19 23:21:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insnlist [2022-07-19 23:21:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_alloc [2022-07-19 23:21:11,617 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_alloc [2022-07-19 23:21:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2022-07-19 23:21:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_fasync [2022-07-19 23:21:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_fasync [2022-07-19 23:21:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 23:21:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 23:21:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure bytes_per_sample [2022-07-19 23:21:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure bytes_per_sample [2022-07-19 23:21:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-19 23:21:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-19 23:21:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:21:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:21:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_alloc_board_minor [2022-07-19 23:21:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_alloc_board_minor [2022-07-19 23:21:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 23:21:11,620 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 23:21:11,620 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_poll [2022-07-19 23:21:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_poll [2022-07-19 23:21:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_n_available [2022-07-19 23:21:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_n_available [2022-07-19 23:21:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-19 23:21:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-19 23:21:11,621 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-19 23:21:11,621 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-19 23:21:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-19 23:21:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-19 23:21:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_cmd [2022-07-19 23:21:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_cmd [2022-07-19 23:21:11,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:21:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:21:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-19 23:21:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-19 23:21:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-19 23:21:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-19 23:21:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_alloc [2022-07-19 23:21:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_alloc [2022-07-19 23:21:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-19 23:21:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-19 23:21:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-19 23:21:11,625 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-19 23:21:11,625 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_in_error [2022-07-19 23:21:11,626 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_in_error [2022-07-19 23:21:11,626 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_detach [2022-07-19 23:21:11,626 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_detach [2022-07-19 23:21:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_check_chanlist [2022-07-19 23:21:11,627 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_check_chanlist [2022-07-19 23:21:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:21:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:21:11,627 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 23:21:11,627 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 23:21:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write [2022-07-19 23:21:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write [2022-07-19 23:21:11,628 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-19 23:21:11,628 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-19 23:21:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-19 23:21:11,629 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-19 23:21:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-19 23:21:11,629 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-19 23:21:11,629 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_proc_open [2022-07-19 23:21:11,630 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_proc_open [2022-07-19 23:21:11,630 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2022-07-19 23:21:11,632 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2022-07-19 23:21:11,632 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 23:21:11,633 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 23:21:11,633 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-19 23:21:11,634 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-19 23:21:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-19 23:21:11,635 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-19 23:21:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure add_wait_queue [2022-07-19 23:21:11,635 INFO L138 BoogieDeclarations]: Found implementation of procedure add_wait_queue [2022-07-19 23:21:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-19 23:21:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-19 23:21:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:21:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:21:11,641 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 23:21:11,641 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 23:21:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_postconfig [2022-07-19 23:21:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_postconfig [2022-07-19 23:21:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-19 23:21:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-19 23:21:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure max_read_buffer_kb_show [2022-07-19 23:21:11,642 INFO L138 BoogieDeclarations]: Found implementation of procedure max_read_buffer_kb_show [2022-07-19 23:21:11,642 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 23:21:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 23:21:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_free_board_dev [2022-07-19 23:21:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_free_board_dev [2022-07-19 23:21:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_free [2022-07-19 23:21:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_free [2022-07-19 23:21:11,643 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_dev_from_minor [2022-07-19 23:21:11,643 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_dev_from_minor [2022-07-19 23:21:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:21:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure compat_alloc_user_space [2022-07-19 23:21:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_alloc_user_space [2022-07-19 23:21:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_cleanup_board_minors [2022-07-19 23:21:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_cleanup_board_minors [2022-07-19 23:21:11,644 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-19 23:21:11,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-19 23:21:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_close [2022-07-19 23:21:11,645 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_close [2022-07-19 23:21:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_write_alloc [2022-07-19 23:21:11,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_write_alloc [2022-07-19 23:21:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure write_buffer_kb_show [2022-07-19 23:21:11,645 INFO L138 BoogieDeclarations]: Found implementation of procedure write_buffer_kb_show [2022-07-19 23:21:11,645 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmd [2022-07-19 23:21:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmd [2022-07-19 23:21:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:21:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:21:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2022-07-19 23:21:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-19 23:21:11,646 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-19 23:21:11,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:21:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-19 23:21:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-19 23:21:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2022-07-19 23:21:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2022-07-19 23:21:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:21:11,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:21:11,647 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_subdevice_from_minor [2022-07-19 23:21:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_subdevice_from_minor [2022-07-19 23:21:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmdtest [2022-07-19 23:21:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmdtest [2022-07-19 23:21:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure read_buffer_kb_show [2022-07-19 23:21:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure read_buffer_kb_show [2022-07-19 23:21:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2022-07-19 23:21:11,648 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2022-07-19 23:21:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:21:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure insn_rw_emulate_bits [2022-07-19 23:21:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure insn_rw_emulate_bits [2022-07-19 23:21:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-19 23:21:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-19 23:21:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:21:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_n_allocated [2022-07-19 23:21:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_n_allocated [2022-07-19 23:21:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_close [2022-07-19 23:21:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_close [2022-07-19 23:21:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:21:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_open [2022-07-19 23:21:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_open [2022-07-19 23:21:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-19 23:21:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 23:21:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-19 23:21:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_idle [2022-07-19 23:21:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_idle [2022-07-19 23:21:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-19 23:21:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-19 23:21:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-19 23:21:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-19 23:21:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure translated_ioctl [2022-07-19 23:21:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure translated_ioctl [2022-07-19 23:21:11,652 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-19 23:21:11,652 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-19 23:21:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-19 23:21:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-19 23:21:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure raw_ioctl [2022-07-19 23:21:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_ioctl [2022-07-19 23:21:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_reset [2022-07-19 23:21:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_reset [2022-07-19 23:21:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure resize_async_buffer [2022-07-19 23:21:11,653 INFO L138 BoogieDeclarations]: Found implementation of procedure resize_async_buffer [2022-07-19 23:21:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure parse_insn [2022-07-19 23:21:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_insn [2022-07-19 23:21:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_get_subdevice_runflags [2022-07-19 23:21:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_get_subdevice_runflags [2022-07-19 23:21:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 23:21:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-19 23:21:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-19 23:21:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure do_become_nonbusy [2022-07-19 23:21:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure do_become_nonbusy [2022-07-19 23:21:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_unlocked_ioctl [2022-07-19 23:21:11,655 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_unlocked_ioctl [2022-07-19 23:21:11,655 INFO L130 BoogieDeclarations]: Found specification of procedure do_cancel [2022-07-19 23:21:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure do_cancel [2022-07-19 23:21:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_insn [2022-07-19 23:21:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_insn [2022-07-19 23:21:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:21:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtouint [2022-07-19 23:21:11,656 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtouint [2022-07-19 23:21:11,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:21:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:21:11,657 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-19 23:21:11,657 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-19 23:21:12,673 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:21:12,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:21:13,263 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:21:15,712 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 23:21:15,793 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume 0 != aref_invalid_~tmp~66#1;havoc aref_invalid_#t~nondet1322#1; [2022-07-19 23:21:15,793 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume !(0 != aref_invalid_~tmp~66#1); [2022-07-19 23:21:15,794 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-19 23:21:15,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !(0 == aref_invalid_~chanspec#1 / 16777216); [2022-07-19 23:21:15,794 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-19 23:21:15,794 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-19 23:21:15,794 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume 0 == aref_invalid_~chanspec#1 / 16777216;aref_invalid_~aref~0#1 := 0; [2022-07-19 23:21:15,795 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-19 23:21:15,795 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-19 23:21:15,795 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-19 23:21:15,795 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-19 23:21:15,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume false;aref_invalid_~aref~0#1 := aref_invalid_~chanspec#1 / 16777216; [2022-07-19 23:21:15,795 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume !false; [2022-07-19 23:21:15,796 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-19 23:21:15,796 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-19 23:21:15,796 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume false;aref_invalid_~aref~0#1 := 3; [2022-07-19 23:21:15,796 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume !false; [2022-07-19 23:21:15,796 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-6: aref_invalid_#t~switch1315#1 := 2 == aref_invalid_~aref~0#1; [2022-07-19 23:21:15,796 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-19 23:21:15,797 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-19 23:21:15,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9008: havoc aref_invalid_#t~switch1315#1; [2022-07-19 23:21:15,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume aref_invalid_#t~switch1315#1; [2022-07-19 23:21:15,797 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume !aref_invalid_#t~switch1315#1; [2022-07-19 23:21:15,797 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-19 23:21:15,797 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-19 23:21:15,797 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-19 23:21:15,798 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-19 23:21:15,798 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-19 23:21:15,798 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := true; [2022-07-19 23:21:15,798 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-19 23:21:15,798 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-19 23:21:15,799 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-19 23:21:15,799 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume !(0 != ~comedi_debug~0); [2022-07-19 23:21:15,799 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-19 23:21:15,799 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-19 23:21:24,250 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:21:24,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:21:24,270 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 23:21:24,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:21:24 BoogieIcfgContainer [2022-07-19 23:21:24,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:21:24,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:21:24,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:21:24,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:21:24,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:21:07" (1/3) ... [2022-07-19 23:21:24,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33740712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:21:24, skipping insertion in model container [2022-07-19 23:21:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:21:10" (2/3) ... [2022-07-19 23:21:24,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33740712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:21:24, skipping insertion in model container [2022-07-19 23:21:24,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:21:24" (3/3) ... [2022-07-19 23:21:24,285 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-19 23:21:24,297 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:21:24,297 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:21:24,414 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:21:24,493 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@4f6c7ed1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1610ba1c [2022-07-19 23:21:24,493 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:21:24,513 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-19 23:21:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 23:21:24,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:21:24,543 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-19 23:21:24,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:21:24,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:21:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash -113660622, now seen corresponding path program 1 times [2022-07-19 23:21:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:21:24,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331881707] [2022-07-19 23:21:24,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:21:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:21:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:21:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:21:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:21:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:21:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:21:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:21:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:21:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:21:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:21:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:21:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:21:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:21:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:21:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:21:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:25,487 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-19 23:21:25,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:21:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331881707] [2022-07-19 23:21:25,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331881707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:21:25,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:21:25,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:21:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968020457] [2022-07-19 23:21:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:21:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:21:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:21:25,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:21:25,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:21:25,526 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-19 23:21:30,605 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-19 23:21:35,109 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-19 23:21:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:21:35,316 INFO L93 Difference]: Finished difference Result 7835 states and 12526 transitions. [2022-07-19 23:21:35,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 23:21:35,320 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-19 23:21:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:21:35,370 INFO L225 Difference]: With dead ends: 7835 [2022-07-19 23:21:35,370 INFO L226 Difference]: Without dead ends: 4002 [2022-07-19 23:21:35,398 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-19 23:21:35,403 INFO L413 NwaCegarLoop]: 5816 mSDtfsCounter, 6299 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 1361 mSolverCounterSat, 980 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6701 SdHoareTripleChecker+Valid, 9406 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1361 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:21:35,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6701 Valid, 9406 Invalid, 2343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [980 Valid, 1361 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2022-07-19 23:21:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-19 23:21:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3788. [2022-07-19 23:21:35,765 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-19 23:21:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5906 transitions. [2022-07-19 23:21:35,791 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5906 transitions. Word has length 106 [2022-07-19 23:21:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:21:35,797 INFO L495 AbstractCegarLoop]: Abstraction has 3788 states and 5906 transitions. [2022-07-19 23:21:35,797 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-19 23:21:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5906 transitions. [2022-07-19 23:21:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 23:21:35,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:21:35,803 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-19 23:21:35,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:21:35,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:21:35,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:21:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 249698647, now seen corresponding path program 1 times [2022-07-19 23:21:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:21:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094716534] [2022-07-19 23:21:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:21:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:21:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:21:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:21:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:21:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:21:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:21:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:21:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:21:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:21:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:21:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:21:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:21:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:21:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:21:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:21:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:36,297 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-19 23:21:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:21:36,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094716534] [2022-07-19 23:21:36,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094716534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:21:36,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:21:36,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:21:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816360365] [2022-07-19 23:21:36,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:21:36,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:21:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:21:36,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:21:36,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:21:36,304 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-19 23:21:40,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:21:46,931 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-19 23:21:49,275 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-19 23:21:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:21:49,388 INFO L93 Difference]: Finished difference Result 11728 states and 18438 transitions. [2022-07-19 23:21:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:21:49,388 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-19 23:21:49,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:21:49,444 INFO L225 Difference]: With dead ends: 11728 [2022-07-19 23:21:49,444 INFO L226 Difference]: Without dead ends: 7949 [2022-07-19 23:21:49,465 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-19 23:21:49,466 INFO L413 NwaCegarLoop]: 6355 mSDtfsCounter, 7007 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 1607 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7464 SdHoareTripleChecker+Valid, 14987 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:21:49,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7464 Valid, 14987 Invalid, 4557 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1607 Valid, 2948 Invalid, 2 Unknown, 0 Unchecked, 12.7s Time] [2022-07-19 23:21:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2022-07-19 23:21:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7578. [2022-07-19 23:21:49,759 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-19 23:21:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11874 transitions. [2022-07-19 23:21:49,794 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11874 transitions. Word has length 108 [2022-07-19 23:21:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:21:49,794 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 11874 transitions. [2022-07-19 23:21:49,795 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-19 23:21:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11874 transitions. [2022-07-19 23:21:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-19 23:21:49,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:21:49,810 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-19 23:21:49,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:21:49,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:21:49,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:21:49,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1851708862, now seen corresponding path program 1 times [2022-07-19 23:21:49,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:21:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116604247] [2022-07-19 23:21:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:21:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:21:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:21:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:21:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:21:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:21:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:21:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:21:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:21:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:21:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:21:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:21:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:21:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:21:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:21:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:21:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 23:21:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:21:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:21:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:21:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:21:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 23:21:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:21:50,246 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-19 23:21:50,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:21:50,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116604247] [2022-07-19 23:21:50,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116604247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:21:50,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:21:50,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:21:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784077929] [2022-07-19 23:21:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:21:50,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:21:50,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:21:50,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:21:50,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:21:50,262 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-19 23:21:55,554 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-19 23:21:59,961 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-19 23:22:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:00,143 INFO L93 Difference]: Finished difference Result 16967 states and 26412 transitions. [2022-07-19 23:22:00,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:22:00,144 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-19 23:22:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:00,206 INFO L225 Difference]: With dead ends: 16967 [2022-07-19 23:22:00,206 INFO L226 Difference]: Without dead ends: 9416 [2022-07-19 23:22:00,241 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-19 23:22:00,242 INFO L413 NwaCegarLoop]: 5973 mSDtfsCounter, 1942 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 886 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:00,242 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.5s Time] [2022-07-19 23:22:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2022-07-19 23:22:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 8930. [2022-07-19 23:22:00,531 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-19 23:22:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13783 transitions. [2022-07-19 23:22:00,572 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13783 transitions. Word has length 151 [2022-07-19 23:22:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:00,573 INFO L495 AbstractCegarLoop]: Abstraction has 8930 states and 13783 transitions. [2022-07-19 23:22:00,573 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-19 23:22:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13783 transitions. [2022-07-19 23:22:00,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-19 23:22:00,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:00,579 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-19 23:22:00,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:22:00,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash 769983256, now seen corresponding path program 1 times [2022-07-19 23:22:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:00,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795225667] [2022-07-19 23:22:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:00,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:22:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 23:22:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:22:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:22:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 23:22:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 23:22:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:00,957 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-19 23:22:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:00,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795225667] [2022-07-19 23:22:00,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795225667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:00,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:00,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:22:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312325698] [2022-07-19 23:22:00,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:00,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:22:00,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:00,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:22:00,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:22:00,959 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-19 23:22:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:08,328 INFO L93 Difference]: Finished difference Result 27721 states and 42979 transitions. [2022-07-19 23:22:08,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:22:08,329 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-19 23:22:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:08,431 INFO L225 Difference]: With dead ends: 27721 [2022-07-19 23:22:08,432 INFO L226 Difference]: Without dead ends: 18816 [2022-07-19 23:22:08,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:22:08,477 INFO L413 NwaCegarLoop]: 6204 mSDtfsCounter, 10427 mSDsluCounter, 8664 mSDsCounter, 0 mSdLazyCounter, 3036 mSolverCounterSat, 4561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10955 SdHoareTripleChecker+Valid, 14868 SdHoareTripleChecker+Invalid, 7597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4561 IncrementalHoareTripleChecker+Valid, 3036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:08,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10955 Valid, 14868 Invalid, 7597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4561 Valid, 3036 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-19 23:22:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2022-07-19 23:22:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 17319. [2022-07-19 23:22:09,215 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-19 23:22:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 26840 transitions. [2022-07-19 23:22:09,278 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 26840 transitions. Word has length 157 [2022-07-19 23:22:09,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:09,279 INFO L495 AbstractCegarLoop]: Abstraction has 17319 states and 26840 transitions. [2022-07-19 23:22:09,280 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-19 23:22:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 26840 transitions. [2022-07-19 23:22:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-19 23:22:09,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:09,289 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-19 23:22:09,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:22:09,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash -937695385, now seen corresponding path program 1 times [2022-07-19 23:22:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:09,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385420413] [2022-07-19 23:22:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:22:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:22:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:22:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:22:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 23:22:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:22:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:22:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:09,644 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-19 23:22:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385420413] [2022-07-19 23:22:09,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385420413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:09,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:09,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:22:09,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268267700] [2022-07-19 23:22:09,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:09,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:22:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:22:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:22:09,647 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-19 23:22:13,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:22:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:16,323 INFO L93 Difference]: Finished difference Result 28028 states and 43168 transitions. [2022-07-19 23:22:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:22:16,324 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-19 23:22:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:16,375 INFO L225 Difference]: With dead ends: 28028 [2022-07-19 23:22:16,375 INFO L226 Difference]: Without dead ends: 10740 [2022-07-19 23:22:16,422 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-19 23:22:16,423 INFO L413 NwaCegarLoop]: 5750 mSDtfsCounter, 6315 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 9323 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:16,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 9323 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-19 23:22:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2022-07-19 23:22:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10086. [2022-07-19 23:22:16,924 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-19 23:22:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 15345 transitions. [2022-07-19 23:22:16,967 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 15345 transitions. Word has length 191 [2022-07-19 23:22:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:16,968 INFO L495 AbstractCegarLoop]: Abstraction has 10086 states and 15345 transitions. [2022-07-19 23:22:16,968 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-19 23:22:16,968 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 15345 transitions. [2022-07-19 23:22:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-19 23:22:16,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:16,980 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-19 23:22:16,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:22:16,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1170401307, now seen corresponding path program 1 times [2022-07-19 23:22:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322037610] [2022-07-19 23:22:16,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 23:22:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 23:22:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 23:22:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:22:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 23:22:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 23:22:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 23:22:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 23:22:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 23:22:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 23:22:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 23:22:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 23:22:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 23:22:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-19 23:22:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 23:22:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:17,452 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-19 23:22:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:17,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322037610] [2022-07-19 23:22:17,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322037610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:17,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:17,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:22:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043142369] [2022-07-19 23:22:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:17,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:22:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:17,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:22:17,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:22:17,455 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-19 23:22:26,413 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-19 23:22:28,446 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-19 23:22:35,040 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-19 23:22:37,073 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-19 23:22:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:37,398 INFO L93 Difference]: Finished difference Result 20724 states and 31634 transitions. [2022-07-19 23:22:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:22:37,399 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-19 23:22:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:37,450 INFO L225 Difference]: With dead ends: 20724 [2022-07-19 23:22:37,450 INFO L226 Difference]: Without dead ends: 11190 [2022-07-19 23:22:37,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:22:37,477 INFO L413 NwaCegarLoop]: 5716 mSDtfsCounter, 1012 mSDsluCounter, 18904 mSDsCounter, 0 mSdLazyCounter, 7439 mSolverCounterSat, 690 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 24620 SdHoareTripleChecker+Invalid, 8133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 7439 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:37,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 24620 Invalid, 8133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 7439 Invalid, 4 Unknown, 0 Unchecked, 19.5s Time] [2022-07-19 23:22:37,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2022-07-19 23:22:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10077. [2022-07-19 23:22:37,778 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-19 23:22:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 15332 transitions. [2022-07-19 23:22:37,814 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 15332 transitions. Word has length 234 [2022-07-19 23:22:37,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:37,815 INFO L495 AbstractCegarLoop]: Abstraction has 10077 states and 15332 transitions. [2022-07-19 23:22:37,815 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-19 23:22:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 15332 transitions. [2022-07-19 23:22:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-19 23:22:37,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:37,823 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-19 23:22:37,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:22:37,823 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:37,824 INFO L85 PathProgramCache]: Analyzing trace with hash 169165785, now seen corresponding path program 1 times [2022-07-19 23:22:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:37,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970294464] [2022-07-19 23:22:37,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:37,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:22:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:22:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:22:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:22:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:22:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 23:22:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 23:22:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 23:22:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 23:22:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 23:22:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-19 23:22:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-19 23:22:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:22:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 23:22:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:38,412 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-19 23:22:38,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:38,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970294464] [2022-07-19 23:22:38,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970294464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:38,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:38,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:22:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439914497] [2022-07-19 23:22:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:22:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:22:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:22:38,415 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-19 23:22:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:44,435 INFO L93 Difference]: Finished difference Result 20201 states and 31043 transitions. [2022-07-19 23:22:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:22:44,436 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-19 23:22:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:44,484 INFO L225 Difference]: With dead ends: 20201 [2022-07-19 23:22:44,484 INFO L226 Difference]: Without dead ends: 10685 [2022-07-19 23:22:44,512 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-19 23:22:44,513 INFO L413 NwaCegarLoop]: 5833 mSDtfsCounter, 8415 mSDsluCounter, 12168 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 2727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8910 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.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:44,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8910 Valid, 18001 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2727 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-19 23:22:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-07-19 23:22:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 9427. [2022-07-19 23:22:44,816 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-19 23:22:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14471 transitions. [2022-07-19 23:22:44,850 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14471 transitions. Word has length 249 [2022-07-19 23:22:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:44,851 INFO L495 AbstractCegarLoop]: Abstraction has 9427 states and 14471 transitions. [2022-07-19 23:22:44,852 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-19 23:22:44,852 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14471 transitions. [2022-07-19 23:22:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-19 23:22:44,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:44,864 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-19 23:22:44,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:22:44,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:44,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:44,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1271706461, now seen corresponding path program 1 times [2022-07-19 23:22:44,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:44,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83875264] [2022-07-19 23:22:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:44,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:22:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:22:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:22:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:22:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:22:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:22:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:22:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:22:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:22:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:22:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:22:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:22:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:22:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:22:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-19 23:22:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-19 23:22:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:22:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-19 23:22:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:45,323 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-19 23:22:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:45,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83875264] [2022-07-19 23:22:45,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83875264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:45,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:45,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:22:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321089250] [2022-07-19 23:22:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:45,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:22:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:22:45,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:22:45,326 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-19 23:22:54,661 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-19 23:22:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:22:55,108 INFO L93 Difference]: Finished difference Result 21600 states and 32975 transitions. [2022-07-19 23:22:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:22:55,109 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-19 23:22:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:22:55,159 INFO L225 Difference]: With dead ends: 21600 [2022-07-19 23:22:55,160 INFO L226 Difference]: Without dead ends: 12734 [2022-07-19 23:22:55,188 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-19 23:22:55,189 INFO L413 NwaCegarLoop]: 6501 mSDtfsCounter, 2618 mSDsluCounter, 12790 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 1136 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 19291 SdHoareTripleChecker+Invalid, 4918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:22:55,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 19291 Invalid, 4918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 3781 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2022-07-19 23:22:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2022-07-19 23:22:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 11694. [2022-07-19 23:22:55,529 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-19 23:22:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17659 transitions. [2022-07-19 23:22:55,569 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17659 transitions. Word has length 273 [2022-07-19 23:22:55,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:22:55,570 INFO L495 AbstractCegarLoop]: Abstraction has 11694 states and 17659 transitions. [2022-07-19 23:22:55,570 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-19 23:22:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17659 transitions. [2022-07-19 23:22:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-19 23:22:55,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:22:55,588 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-19 23:22:55,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:22:55,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:22:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:22:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash 78876558, now seen corresponding path program 1 times [2022-07-19 23:22:55,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:22:55,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295061517] [2022-07-19 23:22:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:22:55,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:22:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:22:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:22:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:22:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:22:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:22:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:22:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:22:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:22:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:22:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:22:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:22:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:22:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:22:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:22:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:22:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:22:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:22:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:22:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:22:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:22:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:22:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:22:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:22:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:22:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:22:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:22:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:22:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:22:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 23:22:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:22:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:22:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:22:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-19 23:22:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:22:56,129 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-19 23:22:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:22:56,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295061517] [2022-07-19 23:22:56,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295061517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:22:56,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:22:56,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:22:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117365624] [2022-07-19 23:22:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:22:56,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:22:56,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:22:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:22:56,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:22:56,132 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-19 23:23:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:23:07,754 INFO L93 Difference]: Finished difference Result 18810 states and 28593 transitions. [2022-07-19 23:23:07,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 23:23:07,754 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-19 23:23:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:23:07,802 INFO L225 Difference]: With dead ends: 18810 [2022-07-19 23:23:07,803 INFO L226 Difference]: Without dead ends: 18807 [2022-07-19 23:23:07,808 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-19 23:23:07,809 INFO L413 NwaCegarLoop]: 11782 mSDtfsCounter, 15929 mSDsluCounter, 16672 mSDsCounter, 0 mSdLazyCounter, 7146 mSolverCounterSat, 5003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16770 SdHoareTripleChecker+Valid, 28454 SdHoareTripleChecker+Invalid, 12149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5003 IncrementalHoareTripleChecker+Valid, 7146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:23:07,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16770 Valid, 28454 Invalid, 12149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5003 Valid, 7146 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-07-19 23:23:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2022-07-19 23:23:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17370. [2022-07-19 23:23:08,323 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-19 23:23:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 26346 transitions. [2022-07-19 23:23:08,386 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 26346 transitions. Word has length 277 [2022-07-19 23:23:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:23:08,387 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 26346 transitions. [2022-07-19 23:23:08,387 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-19 23:23:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 26346 transitions. [2022-07-19 23:23:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-19 23:23:08,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:23:08,398 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-19 23:23:08,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:23:08,398 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:23:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:23:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1509471344, now seen corresponding path program 1 times [2022-07-19 23:23:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:23:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588445834] [2022-07-19 23:23:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:23:08,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:23:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:23:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:23:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:23:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:23:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:23:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:23:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:23:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:23:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:23:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:23:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:23:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:23:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:23:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:23:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:23:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:23:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:23:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:23:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:23:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:23:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:23:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:23:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:23:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:23:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:23:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:23:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:23:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:23:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 23:23:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:23:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-19 23:23:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:09,559 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-19 23:23:09,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:23:09,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588445834] [2022-07-19 23:23:09,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588445834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:23:09,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773302243] [2022-07-19 23:23:09,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:23:09,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:23:09,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:23:09,561 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-19 23:23:09,565 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-19 23:23:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 4904 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 23:23:10,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:23:11,007 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-19 23:23:11,057 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-19 23:23:11,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 23:23:11,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773302243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:23:11,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 23:23:11,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-19 23:23:11,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534726816] [2022-07-19 23:23:11,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:23:11,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:23:11,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:23:11,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:23:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2022-07-19 23:23:11,060 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-19 23:23:16,643 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-19 23:23:20,156 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-19 23:23:22,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:23:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:23:22,278 INFO L93 Difference]: Finished difference Result 34371 states and 52374 transitions. [2022-07-19 23:23:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:23:22,278 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-19 23:23:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:23:22,343 INFO L225 Difference]: With dead ends: 34371 [2022-07-19 23:23:22,343 INFO L226 Difference]: Without dead ends: 17562 [2022-07-19 23:23:22,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-19 23:23:22,382 INFO L413 NwaCegarLoop]: 5818 mSDtfsCounter, 26 mSDsluCounter, 16529 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22347 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:23:22,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22347 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 2 Unknown, 0 Unchecked, 10.7s Time] [2022-07-19 23:23:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2022-07-19 23:23:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 17400. [2022-07-19 23:23:22,927 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-19 23:23:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 26382 transitions. [2022-07-19 23:23:22,990 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 26382 transitions. Word has length 277 [2022-07-19 23:23:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:23:22,991 INFO L495 AbstractCegarLoop]: Abstraction has 17400 states and 26382 transitions. [2022-07-19 23:23:22,991 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-19 23:23:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 26382 transitions. [2022-07-19 23:23:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-19 23:23:23,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:23:23,001 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-19 23:23:23,038 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-19 23:23:23,227 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-19 23:23:23,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:23:23,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:23:23,228 INFO L85 PathProgramCache]: Analyzing trace with hash -459269918, now seen corresponding path program 1 times [2022-07-19 23:23:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:23:23,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480985455] [2022-07-19 23:23:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:23:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:23:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:23:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:23:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:23:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:23:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:23:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:23:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:23:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:23:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:23:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:23:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:23:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:23:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:23:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:23:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:23:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:23:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:23:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:23:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:23:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:23:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:23:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:23:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:23:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:23:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:23:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:23:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:23:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:23:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 23:23:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:23:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-19 23:23:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-19 23:23:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:23,774 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-19 23:23:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:23:23,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480985455] [2022-07-19 23:23:23,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480985455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:23:23,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:23:23,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:23:23,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660510854] [2022-07-19 23:23:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:23:23,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:23:23,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:23:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:23:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:23:23,778 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-19 23:23:31,986 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-19 23:23:39,063 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-19 23:23:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:23:39,924 INFO L93 Difference]: Finished difference Result 37107 states and 56836 transitions. [2022-07-19 23:23:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:23:39,924 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-19 23:23:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:23:39,996 INFO L225 Difference]: With dead ends: 37107 [2022-07-19 23:23:39,996 INFO L226 Difference]: Without dead ends: 20268 [2022-07-19 23:23:40,035 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-19 23:23:40,035 INFO L413 NwaCegarLoop]: 5399 mSDtfsCounter, 5487 mSDsluCounter, 8511 mSDsCounter, 0 mSdLazyCounter, 9012 mSolverCounterSat, 1759 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5838 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 10773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1759 IncrementalHoareTripleChecker+Valid, 9012 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:23:40,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5838 Valid, 13910 Invalid, 10773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1759 Valid, 9012 Invalid, 2 Unknown, 0 Unchecked, 15.4s Time] [2022-07-19 23:23:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2022-07-19 23:23:40,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 18512. [2022-07-19 23:23:40,617 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-19 23:23:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 28246 transitions. [2022-07-19 23:23:40,683 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 28246 transitions. Word has length 279 [2022-07-19 23:23:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:23:40,683 INFO L495 AbstractCegarLoop]: Abstraction has 18512 states and 28246 transitions. [2022-07-19 23:23:40,684 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-19 23:23:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 28246 transitions. [2022-07-19 23:23:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-19 23:23:40,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:23:40,695 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-19 23:23:40,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 23:23:40,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:23:40,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:23:40,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1268616544, now seen corresponding path program 1 times [2022-07-19 23:23:40,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:23:40,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385697496] [2022-07-19 23:23:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:23:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:23:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:23:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:23:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:23:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:23:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:23:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:23:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:23:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:23:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:23:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:23:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:23:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:23:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:23:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:23:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:23:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:23:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:23:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:23:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:23:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:23:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:23:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:23:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:23:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:23:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:23:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:23:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:23:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:23:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 23:23:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:23:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:23:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:23:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-19 23:23:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-19 23:23:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:23:41,199 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-19 23:23:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:23:41,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385697496] [2022-07-19 23:23:41,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385697496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:23:41,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:23:41,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 23:23:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064611817] [2022-07-19 23:23:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:23:41,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 23:23:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:23:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 23:23:41,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:23:41,202 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-19 23:23:57,036 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-19 23:24:19,140 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-19 23:24:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:24:23,511 INFO L93 Difference]: Finished difference Result 51859 states and 80071 transitions. [2022-07-19 23:24:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 23:24:23,511 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-19 23:24:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:24:23,653 INFO L225 Difference]: With dead ends: 51859 [2022-07-19 23:24:23,654 INFO L226 Difference]: Without dead ends: 39401 [2022-07-19 23:24:23,702 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-19 23:24:23,703 INFO L413 NwaCegarLoop]: 10807 mSDtfsCounter, 11320 mSDsluCounter, 37028 mSDsCounter, 0 mSdLazyCounter, 40121 mSolverCounterSat, 3632 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11851 SdHoareTripleChecker+Valid, 47835 SdHoareTripleChecker+Invalid, 43755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3632 IncrementalHoareTripleChecker+Valid, 40121 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:24:23,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11851 Valid, 47835 Invalid, 43755 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3632 Valid, 40121 Invalid, 2 Unknown, 0 Unchecked, 40.7s Time] [2022-07-19 23:24:23,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-07-19 23:24:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 36439. [2022-07-19 23:24:24,739 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-19 23:24:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 55940 transitions. [2022-07-19 23:24:24,848 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 55940 transitions. Word has length 279 [2022-07-19 23:24:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:24:24,849 INFO L495 AbstractCegarLoop]: Abstraction has 36439 states and 55940 transitions. [2022-07-19 23:24:24,850 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-19 23:24:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 55940 transitions. [2022-07-19 23:24:24,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-19 23:24:24,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:24:24,859 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-19 23:24:24,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:24:24,859 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:24:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:24:24,860 INFO L85 PathProgramCache]: Analyzing trace with hash 634260467, now seen corresponding path program 1 times [2022-07-19 23:24:24,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:24:24,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097016308] [2022-07-19 23:24:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:24:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:24:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:24:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:24:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:24:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:24:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:24:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:24:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:24:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:24:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:24:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:24:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:24:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:24:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:24:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:24:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:24:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:24:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 23:24:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 23:24:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:24:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:24:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 23:24:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 23:24:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:24:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 23:24:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 23:24:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:24:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 23:24:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 23:24:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-19 23:24:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:24:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-19 23:24:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-19 23:24:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-19 23:24:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-19 23:24:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-19 23:24:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:25,727 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-19 23:24:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:24:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097016308] [2022-07-19 23:24:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097016308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:24:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595798325] [2022-07-19 23:24:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:24:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:24:25,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:24:25,735 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-19 23:24:25,737 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-19 23:24:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:24:27,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-19 23:24:27,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:24:27,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:27,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:27,188 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:24:27,188 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-19 23:24:27,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:27,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:27,211 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 23:24:27,211 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-19 23:24:28,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:28,293 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-19 23:24:28,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:28,298 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-19 23:24:28,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:28,531 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-19 23:24:28,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:24:28,537 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-19 23:24:28,959 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-19 23:24:28,962 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-19 23:24:29,022 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-19 23:24:29,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:24:41,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595798325] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:24:41,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 23:24:41,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 24 [2022-07-19 23:24:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801072575] [2022-07-19 23:24:41,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 23:24:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 23:24:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:24:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 23:24:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-19 23:24:41,433 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)