./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 791161d1 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-?-791161d [2022-07-22 23:35:03,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:35:03,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:35:03,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:35:03,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:35:03,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:35:03,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:35:03,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:35:03,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:35:03,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:35:03,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:35:03,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:35:03,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:35:03,988 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:35:03,989 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:35:03,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:35:03,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:35:03,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:35:03,995 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:35:03,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:35:04,000 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:35:04,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:35:04,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:35:04,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:35:04,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:35:04,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:35:04,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:35:04,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:35:04,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:35:04,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:35:04,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:35:04,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:35:04,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:35:04,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:35:04,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:35:04,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:35:04,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:35:04,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:35:04,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:35:04,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:35:04,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:35:04,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:35:04,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 23:35:04,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:35:04,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:35:04,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:35:04,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:35:04,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:35:04,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:35:04,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:35:04,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:35:04,043 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:35:04,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:35:04,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 23:35:04,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:35:04,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:35:04,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:35:04,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:35:04,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:35:04,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 23:35:04,047 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:35:04,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:35:04,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:35:04,048 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-22 23:35:04,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:35:04,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:35:04,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:35:04,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:35:04,240 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:35:04,241 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-22 23:35:04,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc6aa13d/5f0cb68a28d34b0fa51d4683f8b5245e/FLAG68e010e15 [2022-07-22 23:35:04,967 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:35:04,968 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-22 23:35:05,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc6aa13d/5f0cb68a28d34b0fa51d4683f8b5245e/FLAG68e010e15 [2022-07-22 23:35:05,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cc6aa13d/5f0cb68a28d34b0fa51d4683f8b5245e [2022-07-22 23:35:05,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:35:05,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:35:05,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:35:05,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:35:05,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:35:05,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:35:05" (1/1) ... [2022-07-22 23:35:05,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd3557 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:05, skipping insertion in model container [2022-07-22 23:35:05,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:35:05" (1/1) ... [2022-07-22 23:35:05,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:35:05,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:35:05,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-08_1a-drivers--staging--comedi--comedi.ko-entry_point.cil.out.i[116803,116816] [2022-07-22 23:35:07,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:35:07,372 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:35:07,437 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-22 23:35:07,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:35:07,794 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:35:07,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07 WrapperNode [2022-07-22 23:35:07,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:35:07,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:35:07,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:35:07,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:35:07,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:07,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,131 INFO L137 Inliner]: procedures = 367, calls = 4074, calls flagged for inlining = 161, calls inlined = 138, statements flattened = 10019 [2022-07-22 23:35:08,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:35:08,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:35:08,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:35:08,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:35:08,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:35:08,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:35:08,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:35:08,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:35:08,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (1/1) ... [2022-07-22 23:35:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:35:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:35:08,657 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-22 23:35:08,677 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-22 23:35:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_free [2022-07-22 23:35:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_free [2022-07-22 23:35:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_mmap [2022-07-22 23:35:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_mmap [2022-07-22 23:35:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2022-07-22 23:35:08,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2022-07-22 23:35:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-22 23:35:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-07-22 23:35:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_compat_ioctl [2022-07-22 23:35:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_compat_ioctl [2022-07-22 23:35:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure remove_wait_queue [2022-07-22 23:35:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_wait_queue [2022-07-22 23:35:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-22 23:35:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-22 23:35:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-22 23:35:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:35:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:35:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_running [2022-07-22 23:35:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_running [2022-07-22 23:35:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_alloc [2022-07-22 23:35:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_alloc [2022-07-22 23:35:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure compat_chaninfo [2022-07-22 23:35:08,697 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_chaninfo [2022-07-22 23:35:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_cleanup [2022-07-22 23:35:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_cleanup [2022-07-22 23:35:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write_subdevice [2022-07-22 23:35:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write_subdevice [2022-07-22 23:35:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure max_write_buffer_kb_show [2022-07-22 23:35:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure max_write_buffer_kb_show [2022-07-22 23:35:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_set_subdevice_runflags [2022-07-22 23:35:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_set_subdevice_runflags [2022-07-22 23:35:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure file_inode [2022-07-22 23:35:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure file_inode [2022-07-22 23:35:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-22 23:35:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-22 23:35:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:35:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:35:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-22 23:35:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-22 23:35:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_read_subdevice [2022-07-22 23:35:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_read_subdevice [2022-07-22 23:35:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_free [2022-07-22 23:35:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_free [2022-07-22 23:35:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_open [2022-07-22 23:35:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_open [2022-07-22 23:35:08,700 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-22 23:35:08,700 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-22 23:35:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:35:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:35:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure compat_rangeinfo [2022-07-22 23:35:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_rangeinfo [2022-07-22 23:35:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insn [2022-07-22 23:35:08,701 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insn [2022-07-22 23:35:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure compat_insnlist [2022-07-22 23:35:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_insnlist [2022-07-22 23:35:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_alloc [2022-07-22 23:35:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_alloc [2022-07-22 23:35:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2022-07-22 23:35:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_fasync [2022-07-22 23:35:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_fasync [2022-07-22 23:35:08,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 23:35:08,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 23:35:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure bytes_per_sample [2022-07-22 23:35:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure bytes_per_sample [2022-07-22 23:35:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure kcalloc [2022-07-22 23:35:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure kcalloc [2022-07-22 23:35:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:35:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:35:08,716 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_alloc_board_minor [2022-07-22 23:35:08,716 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_alloc_board_minor [2022-07-22 23:35:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 23:35:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 23:35:08,717 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_poll [2022-07-22 23:35:08,717 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_poll [2022-07-22 23:35:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_read_n_available [2022-07-22 23:35:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_read_n_available [2022-07-22 23:35:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-22 23:35:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-22 23:35:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-22 23:35:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-22 23:35:08,718 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-22 23:35:08,718 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-22 23:35:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_cmd [2022-07-22 23:35:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_cmd [2022-07-22 23:35:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:35:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:35:08,719 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-22 23:35:08,719 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-22 23:35:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-22 23:35:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-22 23:35:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_alloc [2022-07-22 23:35:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_alloc [2022-07-22 23:35:08,720 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-22 23:35:08,720 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-22 23:35:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-22 23:35:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-22 23:35:08,721 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_in_error [2022-07-22 23:35:08,721 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_in_error [2022-07-22 23:35:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_detach [2022-07-22 23:35:08,722 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_detach [2022-07-22 23:35:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_check_chanlist [2022-07-22 23:35:08,722 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_check_chanlist [2022-07-22 23:35:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:35:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:35:08,722 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-22 23:35:08,723 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-22 23:35:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_write [2022-07-22 23:35:08,723 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_write [2022-07-22 23:35:08,723 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-22 23:35:08,723 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-22 23:35:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-22 23:35:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-22 23:35:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-22 23:35:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-22 23:35:08,724 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_proc_open [2022-07-22 23:35:08,724 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_proc_open [2022-07-22 23:35:08,725 INFO L130 BoogieDeclarations]: Found specification of procedure test_ti_thread_flag [2022-07-22 23:35:08,727 INFO L138 BoogieDeclarations]: Found implementation of procedure test_ti_thread_flag [2022-07-22 23:35:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-22 23:35:08,727 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-22 23:35:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-22 23:35:08,727 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-22 23:35:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-22 23:35:08,729 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-22 23:35:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure add_wait_queue [2022-07-22 23:35:08,729 INFO L138 BoogieDeclarations]: Found implementation of procedure add_wait_queue [2022-07-22 23:35:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-07-22 23:35:08,733 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-07-22 23:35:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:35:08,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:35:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-22 23:35:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-22 23:35:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_device_postconfig [2022-07-22 23:35:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_device_postconfig [2022-07-22 23:35:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-22 23:35:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-22 23:35:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure max_read_buffer_kb_show [2022-07-22 23:35:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure max_read_buffer_kb_show [2022-07-22 23:35:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 23:35:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 23:35:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_free_board_dev [2022-07-22 23:35:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_free_board_dev [2022-07-22 23:35:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_free [2022-07-22 23:35:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_free [2022-07-22 23:35:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_dev_from_minor [2022-07-22 23:35:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_dev_from_minor [2022-07-22 23:35:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 23:35:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure compat_alloc_user_space [2022-07-22 23:35:08,735 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_alloc_user_space [2022-07-22 23:35:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_cleanup_board_minors [2022-07-22 23:35:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_cleanup_board_minors [2022-07-22 23:35:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2022-07-22 23:35:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2022-07-22 23:35:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_vm_close [2022-07-22 23:35:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_vm_close [2022-07-22 23:35:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure __comedi_buf_write_alloc [2022-07-22 23:35:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __comedi_buf_write_alloc [2022-07-22 23:35:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure write_buffer_kb_show [2022-07-22 23:35:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure write_buffer_kb_show [2022-07-22 23:35:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmd [2022-07-22 23:35:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmd [2022-07-22 23:35:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:35:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:35:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2022-07-22 23:35:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure vfree [2022-07-22 23:35:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure vfree [2022-07-22 23:35:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 23:35:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-22 23:35:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-22 23:35:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure single_release [2022-07-22 23:35:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure single_release [2022-07-22 23:35:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:35:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:35:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_subdevice_from_minor [2022-07-22 23:35:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_subdevice_from_minor [2022-07-22 23:35:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure compat_cmdtest [2022-07-22 23:35:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_cmdtest [2022-07-22 23:35:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure read_buffer_kb_show [2022-07-22 23:35:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure read_buffer_kb_show [2022-07-22 23:35:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2022-07-22 23:35:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2022-07-22 23:35:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:35:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure insn_rw_emulate_bits [2022-07-22 23:35:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure insn_rw_emulate_bits [2022-07-22 23:35:08,739 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-22 23:35:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_write_n_allocated [2022-07-22 23:35:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_write_n_allocated [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_close [2022-07-22 23:35:08,740 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_close [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:35:08,740 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_open [2022-07-22 23:35:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_open [2022-07-22 23:35:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-22 23:35:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:35:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:35:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_is_subdevice_idle [2022-07-22 23:35:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_is_subdevice_idle [2022-07-22 23:35:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-07-22 23:35:08,741 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-07-22 23:35:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-22 23:35:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-22 23:35:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure translated_ioctl [2022-07-22 23:35:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure translated_ioctl [2022-07-22 23:35:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-22 23:35:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-22 23:35:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-22 23:35:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-22 23:35:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure raw_ioctl [2022-07-22 23:35:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure raw_ioctl [2022-07-22 23:35:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_buf_reset [2022-07-22 23:35:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_buf_reset [2022-07-22 23:35:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure resize_async_buffer [2022-07-22 23:35:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure resize_async_buffer [2022-07-22 23:35:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure parse_insn [2022-07-22 23:35:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_insn [2022-07-22 23:35:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_get_subdevice_runflags [2022-07-22 23:35:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_get_subdevice_runflags [2022-07-22 23:35:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-22 23:35:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2022-07-22 23:35:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2022-07-22 23:35:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure do_become_nonbusy [2022-07-22 23:35:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure do_become_nonbusy [2022-07-22 23:35:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure comedi_unlocked_ioctl [2022-07-22 23:35:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure comedi_unlocked_ioctl [2022-07-22 23:35:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure do_cancel [2022-07-22 23:35:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure do_cancel [2022-07-22 23:35:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure get_compat_insn [2022-07-22 23:35:08,745 INFO L138 BoogieDeclarations]: Found implementation of procedure get_compat_insn [2022-07-22 23:35:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 23:35:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtouint [2022-07-22 23:35:08,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtouint [2022-07-22 23:35:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:35:08,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:35:08,745 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-22 23:35:08,745 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-22 23:35:09,656 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:35:09,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:35:10,153 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:35:12,377 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 23:35:12,432 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume 0 != aref_invalid_~tmp~66#1;havoc aref_invalid_#t~nondet1322#1; [2022-07-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9045: assume !(0 != aref_invalid_~tmp~66#1); [2022-07-22 23:35:12,433 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-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !(0 == aref_invalid_~chanspec#1 / 16777216); [2022-07-22 23:35:12,433 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-22 23:35:12,433 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-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume 0 == aref_invalid_~chanspec#1 / 16777216;aref_invalid_~aref~0#1 := 0; [2022-07-22 23:35:12,433 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-22 23:35:12,433 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-22 23:35:12,433 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-22 23:35:12,433 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-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume false;aref_invalid_~aref~0#1 := aref_invalid_~chanspec#1 / 16777216; [2022-07-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-2: assume !false; [2022-07-22 23:35:12,433 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-22 23:35:12,433 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-22 23:35:12,433 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume false;aref_invalid_~aref~0#1 := 3; [2022-07-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007: assume !false; [2022-07-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9007-6: aref_invalid_#t~switch1315#1 := 2 == aref_invalid_~aref~0#1; [2022-07-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9008: havoc aref_invalid_#t~switch1315#1; [2022-07-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume aref_invalid_#t~switch1315#1; [2022-07-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9033: assume !aref_invalid_#t~switch1315#1; [2022-07-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,434 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9027: assume !aref_invalid_#t~switch1315#1;aref_invalid_#t~switch1315#1 := true; [2022-07-22 23:35:12,434 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-22 23:35:12,434 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-22 23:35:12,435 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-22 23:35:12,435 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L9036: assume !(0 != ~comedi_debug~0); [2022-07-22 23:35:12,435 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-22 23:35:12,435 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-22 23:35:20,460 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:35:20,486 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:35:20,486 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 23:35:20,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:35:20 BoogieIcfgContainer [2022-07-22 23:35:20,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:35:20,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:35:20,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:35:20,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:35:20,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:35:05" (1/3) ... [2022-07-22 23:35:20,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a0139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:35:20, skipping insertion in model container [2022-07-22 23:35:20,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:35:07" (2/3) ... [2022-07-22 23:35:20,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a0139c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:35:20, skipping insertion in model container [2022-07-22 23:35:20,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:35:20" (3/3) ... [2022-07-22 23:35:20,499 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-22 23:35:20,509 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:35:20,509 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:35:20,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:35:20,608 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@4c622f02, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60fef720 [2022-07-22 23:35:20,608 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:35:20,620 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-22 23:35:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-22 23:35:20,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:35:20,648 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-22 23:35:20,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:35:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:35:20,653 INFO L85 PathProgramCache]: Analyzing trace with hash -113660622, now seen corresponding path program 1 times [2022-07-22 23:35:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:35:20,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644617148] [2022-07-22 23:35:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:35:20,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:35:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:35:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:35:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:35:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:35:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:35:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:35:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:35:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:35:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:35:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:35:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:35:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:35:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:35:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:35:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:21,416 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-22 23:35:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:35:21,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644617148] [2022-07-22 23:35:21,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644617148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:35:21,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:35:21,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:35:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478286280] [2022-07-22 23:35:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:35:21,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:35:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:35:21,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:35:21,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:35:21,458 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-22 23:35:28,784 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-22 23:35:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:35:28,975 INFO L93 Difference]: Finished difference Result 7835 states and 12526 transitions. [2022-07-22 23:35:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 23:35:28,979 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-22 23:35:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:35:29,029 INFO L225 Difference]: With dead ends: 7835 [2022-07-22 23:35:29,029 INFO L226 Difference]: Without dead ends: 4002 [2022-07-22 23:35:29,054 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-22 23:35:29,057 INFO L413 NwaCegarLoop]: 5816 mSDtfsCounter, 6299 mSDsluCounter, 3590 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 980 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6701 SdHoareTripleChecker+Valid, 9406 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:35:29,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6701 Valid, 9406 Invalid, 2343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [980 Valid, 1362 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2022-07-22 23:35:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-07-22 23:35:29,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3788. [2022-07-22 23:35:29,303 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-22 23:35:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 5906 transitions. [2022-07-22 23:35:29,335 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 5906 transitions. Word has length 106 [2022-07-22 23:35:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:35:29,339 INFO L495 AbstractCegarLoop]: Abstraction has 3788 states and 5906 transitions. [2022-07-22 23:35:29,339 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-22 23:35:29,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 5906 transitions. [2022-07-22 23:35:29,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-22 23:35:29,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:35:29,347 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-22 23:35:29,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 23:35:29,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:35:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:35:29,348 INFO L85 PathProgramCache]: Analyzing trace with hash 249698647, now seen corresponding path program 1 times [2022-07-22 23:35:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:35:29,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153046007] [2022-07-22 23:35:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:35:29,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:35:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:35:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:35:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:35:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:35:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:35:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:35:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:35:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:35:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:35:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:35:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:35:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:35:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:35:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:35:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:29,842 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-22 23:35:29,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:35:29,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153046007] [2022-07-22 23:35:29,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153046007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:35:29,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:35:29,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:35:29,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491685847] [2022-07-22 23:35:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:35:29,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:35:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:35:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:35:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:35:29,850 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-22 23:35:35,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:35:42,368 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-22 23:35:44,745 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-22 23:35:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:35:44,896 INFO L93 Difference]: Finished difference Result 11728 states and 18438 transitions. [2022-07-22 23:35:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:35:44,897 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-22 23:35:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:35:44,949 INFO L225 Difference]: With dead ends: 11728 [2022-07-22 23:35:44,949 INFO L226 Difference]: Without dead ends: 7949 [2022-07-22 23:35:44,973 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-22 23:35:44,974 INFO L413 NwaCegarLoop]: 6359 mSDtfsCounter, 7007 mSDsluCounter, 8640 mSDsCounter, 0 mSdLazyCounter, 2948 mSolverCounterSat, 1607 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7464 SdHoareTripleChecker+Valid, 14999 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 2948 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:35:44,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7464 Valid, 14999 Invalid, 4557 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1607 Valid, 2948 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2022-07-22 23:35:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7949 states. [2022-07-22 23:35:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7949 to 7578. [2022-07-22 23:35:45,416 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-22 23:35:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 11874 transitions. [2022-07-22 23:35:45,445 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 11874 transitions. Word has length 108 [2022-07-22 23:35:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:35:45,446 INFO L495 AbstractCegarLoop]: Abstraction has 7578 states and 11874 transitions. [2022-07-22 23:35:45,447 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-22 23:35:45,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 11874 transitions. [2022-07-22 23:35:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-22 23:35:45,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:35:45,459 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-22 23:35:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 23:35:45,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:35:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:35:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1851708862, now seen corresponding path program 1 times [2022-07-22 23:35:45,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:35:45,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903714231] [2022-07-22 23:35:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:35:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:35:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:35:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:35:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:35:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:35:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:35:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:35:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:35:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:35:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:35:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:35:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:35:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:35:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:35:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:35:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 23:35:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:35:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:35:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:35:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:35:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 23:35:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:45,886 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-22 23:35:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:35:45,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903714231] [2022-07-22 23:35:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903714231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:35:45,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:35:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:35:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371160936] [2022-07-22 23:35:45,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:35:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:35:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:35:45,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:35:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:35:45,890 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-22 23:35:51,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:35:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:35:54,630 INFO L93 Difference]: Finished difference Result 16967 states and 26412 transitions. [2022-07-22 23:35:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:35:54,631 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-22 23:35:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:35:54,689 INFO L225 Difference]: With dead ends: 16967 [2022-07-22 23:35:54,689 INFO L226 Difference]: Without dead ends: 9416 [2022-07-22 23:35:54,717 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-22 23:35:54,721 INFO L413 NwaCegarLoop]: 5969 mSDtfsCounter, 1942 mSDsluCounter, 8489 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 886 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 14458 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-22 23:35:54,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 14458 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-07-22 23:35:54,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2022-07-22 23:35:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 8930. [2022-07-22 23:35:54,993 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-22 23:35:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 13783 transitions. [2022-07-22 23:35:55,027 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 13783 transitions. Word has length 151 [2022-07-22 23:35:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:35:55,028 INFO L495 AbstractCegarLoop]: Abstraction has 8930 states and 13783 transitions. [2022-07-22 23:35:55,028 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-22 23:35:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 13783 transitions. [2022-07-22 23:35:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 23:35:55,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:35:55,033 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-22 23:35:55,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 23:35:55,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:35:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:35:55,034 INFO L85 PathProgramCache]: Analyzing trace with hash 769983256, now seen corresponding path program 1 times [2022-07-22 23:35:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:35:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596625567] [2022-07-22 23:35:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:35:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:35:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:35:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:35:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:35:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:35:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:35:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:35:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:35:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:35:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:35:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:35:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:35:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:35:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:35:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:35:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 23:35:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 23:35:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-22 23:35:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:35:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 23:35:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 23:35:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:35:55,415 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-22 23:35:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:35:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596625567] [2022-07-22 23:35:55,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596625567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:35:55,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:35:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:35:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81070799] [2022-07-22 23:35:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:35:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:35:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:35:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:35:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:35:55,418 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-22 23:36:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:36:02,738 INFO L93 Difference]: Finished difference Result 27721 states and 42979 transitions. [2022-07-22 23:36:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:36:02,739 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-22 23:36:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:36:02,825 INFO L225 Difference]: With dead ends: 27721 [2022-07-22 23:36:02,826 INFO L226 Difference]: Without dead ends: 18816 [2022-07-22 23:36:02,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:36:02,860 INFO L413 NwaCegarLoop]: 6206 mSDtfsCounter, 10427 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 3035 mSolverCounterSat, 4561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10953 SdHoareTripleChecker+Valid, 14871 SdHoareTripleChecker+Invalid, 7596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4561 IncrementalHoareTripleChecker+Valid, 3035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:36:02,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10953 Valid, 14871 Invalid, 7596 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4561 Valid, 3035 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-07-22 23:36:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18816 states. [2022-07-22 23:36:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18816 to 17319. [2022-07-22 23:36:03,369 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-22 23:36:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17319 states to 17319 states and 26840 transitions. [2022-07-22 23:36:03,425 INFO L78 Accepts]: Start accepts. Automaton has 17319 states and 26840 transitions. Word has length 157 [2022-07-22 23:36:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:36:03,426 INFO L495 AbstractCegarLoop]: Abstraction has 17319 states and 26840 transitions. [2022-07-22 23:36:03,427 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-22 23:36:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17319 states and 26840 transitions. [2022-07-22 23:36:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2022-07-22 23:36:03,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:36:03,434 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-22 23:36:03,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 23:36:03,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:36:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:36:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash -937695385, now seen corresponding path program 1 times [2022-07-22 23:36:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:36:03,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379307964] [2022-07-22 23:36:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:36:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:36:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:36:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:36:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:36:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:36:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:36:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:36:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:36:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:36:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:36:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:36:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:36:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:36:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:36:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:36:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:36:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-22 23:36:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-22 23:36:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:36:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-22 23:36:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:03,813 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-22 23:36:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:36:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379307964] [2022-07-22 23:36:03,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379307964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:36:03,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:36:03,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:36:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568116189] [2022-07-22 23:36:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:36:03,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:36:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:36:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:36:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:36:03,815 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-22 23:36:08,516 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-22 23:36:12,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:36:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:36:12,359 INFO L93 Difference]: Finished difference Result 28028 states and 43168 transitions. [2022-07-22 23:36:12,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:36:12,360 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-22 23:36:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:36:12,401 INFO L225 Difference]: With dead ends: 28028 [2022-07-22 23:36:12,401 INFO L226 Difference]: Without dead ends: 10740 [2022-07-22 23:36:12,436 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-22 23:36:12,439 INFO L413 NwaCegarLoop]: 5750 mSDtfsCounter, 6315 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 983 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 9323 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:36:12,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 9323 Invalid, 2336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 1352 Invalid, 1 Unknown, 0 Unchecked, 8.1s Time] [2022-07-22 23:36:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10740 states. [2022-07-22 23:36:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10740 to 10086. [2022-07-22 23:36:12,697 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-22 23:36:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 15345 transitions. [2022-07-22 23:36:12,734 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 15345 transitions. Word has length 191 [2022-07-22 23:36:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:36:12,735 INFO L495 AbstractCegarLoop]: Abstraction has 10086 states and 15345 transitions. [2022-07-22 23:36:12,735 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-22 23:36:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 15345 transitions. [2022-07-22 23:36:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-22 23:36:12,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:36:12,746 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-22 23:36:12,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 23:36:12,746 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:36:12,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:36:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1170401307, now seen corresponding path program 1 times [2022-07-22 23:36:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:36:12,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081686530] [2022-07-22 23:36:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:36:12,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:36:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:36:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:36:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:36:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:36:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:36:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:36:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:36:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:36:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:36:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:36:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:36:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:36:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 23:36:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 23:36:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 23:36:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 23:36:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-22 23:36:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-22 23:36:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-22 23:36:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 23:36:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 23:36:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:36:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 23:36:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-22 23:36:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-22 23:36:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-22 23:36:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 23:36:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:13,192 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-22 23:36:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:36:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081686530] [2022-07-22 23:36:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081686530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:36:13,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:36:13,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:36:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882649601] [2022-07-22 23:36:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:36:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:36:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:36:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:36:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:36:13,195 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-22 23:36:19,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:36:22,020 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-22 23:36:29,323 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-22 23:36:31,354 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-22 23:36:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:36:31,762 INFO L93 Difference]: Finished difference Result 20724 states and 31634 transitions. [2022-07-22 23:36:31,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 23:36:31,763 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-22 23:36:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:36:31,823 INFO L225 Difference]: With dead ends: 20724 [2022-07-22 23:36:31,824 INFO L226 Difference]: Without dead ends: 11190 [2022-07-22 23:36:31,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:36:31,851 INFO L413 NwaCegarLoop]: 5717 mSDtfsCounter, 1012 mSDsluCounter, 18908 mSDsCounter, 0 mSdLazyCounter, 7441 mSolverCounterSat, 690 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 24625 SdHoareTripleChecker+Invalid, 8134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 690 IncrementalHoareTripleChecker+Valid, 7441 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:36:31,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 24625 Invalid, 8134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [690 Valid, 7441 Invalid, 3 Unknown, 0 Unchecked, 18.1s Time] [2022-07-22 23:36:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2022-07-22 23:36:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 10077. [2022-07-22 23:36:32,162 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-22 23:36:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10077 states to 10077 states and 15332 transitions. [2022-07-22 23:36:32,189 INFO L78 Accepts]: Start accepts. Automaton has 10077 states and 15332 transitions. Word has length 234 [2022-07-22 23:36:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:36:32,189 INFO L495 AbstractCegarLoop]: Abstraction has 10077 states and 15332 transitions. [2022-07-22 23:36:32,189 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-22 23:36:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 10077 states and 15332 transitions. [2022-07-22 23:36:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-22 23:36:32,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:36:32,195 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-22 23:36:32,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 23:36:32,196 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:36:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:36:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 169165785, now seen corresponding path program 1 times [2022-07-22 23:36:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:36:32,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589575389] [2022-07-22 23:36:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:36:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:36:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:36:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:36:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:36:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:36:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:36:32,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:36:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:36:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:36:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:36:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:36:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:36:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:36:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:36:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:36:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:36:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:36:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:36:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 23:36:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 23:36:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-22 23:36:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-22 23:36:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-22 23:36:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-22 23:36:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-22 23:36:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:36:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 23:36:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:32,713 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-22 23:36:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:36:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589575389] [2022-07-22 23:36:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589575389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:36:32,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:36:32,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 23:36:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657535850] [2022-07-22 23:36:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:36:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 23:36:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:36:32,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 23:36:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:36:32,715 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-22 23:36:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:36:39,268 INFO L93 Difference]: Finished difference Result 20201 states and 31043 transitions. [2022-07-22 23:36:39,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:36:39,269 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-22 23:36:39,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:36:39,305 INFO L225 Difference]: With dead ends: 20201 [2022-07-22 23:36:39,305 INFO L226 Difference]: Without dead ends: 10685 [2022-07-22 23:36:39,328 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-22 23:36:39,329 INFO L413 NwaCegarLoop]: 5833 mSDtfsCounter, 8415 mSDsluCounter, 12168 mSDsCounter, 0 mSdLazyCounter, 3898 mSolverCounterSat, 2727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8908 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, 6.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:36:39,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8908 Valid, 18001 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2727 Valid, 3898 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-22 23:36:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10685 states. [2022-07-22 23:36:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10685 to 9427. [2022-07-22 23:36:39,562 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-22 23:36:39,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 14471 transitions. [2022-07-22 23:36:39,589 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 14471 transitions. Word has length 249 [2022-07-22 23:36:39,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:36:39,589 INFO L495 AbstractCegarLoop]: Abstraction has 9427 states and 14471 transitions. [2022-07-22 23:36:39,589 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-22 23:36:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 14471 transitions. [2022-07-22 23:36:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-22 23:36:39,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:36:39,598 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-22 23:36:39,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 23:36:39,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:36:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:36:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1271706461, now seen corresponding path program 1 times [2022-07-22 23:36:39,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:36:39,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637493610] [2022-07-22 23:36:39,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:36:39,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:36:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:36:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:36:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:36:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:36:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:36:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:36:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:36:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:36:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:36:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:36:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:36:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:36:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:36:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:36:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:36:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:36:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:36:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:36:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:36:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:36:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:36:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:36:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:36:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:36:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:36:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:36:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-22 23:36:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-22 23:36:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:36:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-22 23:36:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:39,942 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-22 23:36:39,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:36:39,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637493610] [2022-07-22 23:36:39,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637493610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:36:39,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:36:39,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:36:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209370244] [2022-07-22 23:36:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:36:39,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:36:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:36:39,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:36:39,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:36:39,944 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-22 23:36:42,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:36:46,757 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-22 23:36:51,145 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-22 23:36:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:36:51,627 INFO L93 Difference]: Finished difference Result 21600 states and 32975 transitions. [2022-07-22 23:36:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:36:51,628 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-22 23:36:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:36:51,672 INFO L225 Difference]: With dead ends: 21600 [2022-07-22 23:36:51,672 INFO L226 Difference]: Without dead ends: 12734 [2022-07-22 23:36:51,695 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-22 23:36:51,696 INFO L413 NwaCegarLoop]: 6501 mSDtfsCounter, 2618 mSDsluCounter, 12789 mSDsCounter, 0 mSdLazyCounter, 3780 mSolverCounterSat, 1136 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 19290 SdHoareTripleChecker+Invalid, 4918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 3780 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:36:51,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 19290 Invalid, 4918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 3780 Invalid, 2 Unknown, 0 Unchecked, 11.2s Time] [2022-07-22 23:36:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12734 states. [2022-07-22 23:36:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12734 to 11694. [2022-07-22 23:36:51,974 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-22 23:36:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11694 states to 11694 states and 17659 transitions. [2022-07-22 23:36:52,005 INFO L78 Accepts]: Start accepts. Automaton has 11694 states and 17659 transitions. Word has length 273 [2022-07-22 23:36:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:36:52,006 INFO L495 AbstractCegarLoop]: Abstraction has 11694 states and 17659 transitions. [2022-07-22 23:36:52,006 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-22 23:36:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 11694 states and 17659 transitions. [2022-07-22 23:36:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-22 23:36:52,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:36:52,014 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-22 23:36:52,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 23:36:52,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:36:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:36:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash 78876558, now seen corresponding path program 1 times [2022-07-22 23:36:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:36:52,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705813414] [2022-07-22 23:36:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:36:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:36:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:36:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:36:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:36:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:36:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:36:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:36:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:36:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:36:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:36:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:36:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:36:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:36:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:36:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:36:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:36:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:36:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:36:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:36:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:36:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:36:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:36:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:36:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:36:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:36:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:36:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:36:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:36:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:36:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 23:36:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:36:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:36:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:36:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-22 23:36:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:36:52,550 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-22 23:36:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:36:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705813414] [2022-07-22 23:36:52,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705813414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:36:52,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:36:52,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:36:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953501455] [2022-07-22 23:36:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:36:52,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:36:52,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:36:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:36:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:36:52,553 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-22 23:37:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:37:04,049 INFO L93 Difference]: Finished difference Result 18810 states and 28593 transitions. [2022-07-22 23:37:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:37:04,050 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-22 23:37:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:37:04,108 INFO L225 Difference]: With dead ends: 18810 [2022-07-22 23:37:04,109 INFO L226 Difference]: Without dead ends: 18807 [2022-07-22 23:37:04,119 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-22 23:37:04,120 INFO L413 NwaCegarLoop]: 11782 mSDtfsCounter, 15925 mSDsluCounter, 16672 mSDsCounter, 0 mSdLazyCounter, 7149 mSolverCounterSat, 5001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16766 SdHoareTripleChecker+Valid, 28454 SdHoareTripleChecker+Invalid, 12150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5001 IncrementalHoareTripleChecker+Valid, 7149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:37:04,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16766 Valid, 28454 Invalid, 12150 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5001 Valid, 7149 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-07-22 23:37:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2022-07-22 23:37:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 17370. [2022-07-22 23:37:04,533 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-22 23:37:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17370 states to 17370 states and 26346 transitions. [2022-07-22 23:37:04,582 INFO L78 Accepts]: Start accepts. Automaton has 17370 states and 26346 transitions. Word has length 277 [2022-07-22 23:37:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:37:04,582 INFO L495 AbstractCegarLoop]: Abstraction has 17370 states and 26346 transitions. [2022-07-22 23:37:04,583 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-22 23:37:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 17370 states and 26346 transitions. [2022-07-22 23:37:04,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2022-07-22 23:37:04,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:37:04,592 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-22 23:37:04,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 23:37:04,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:37:04,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:37:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1509471344, now seen corresponding path program 1 times [2022-07-22 23:37:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:37:04,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289095372] [2022-07-22 23:37:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:37:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:37:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:37:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:37:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:37:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:37:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:37:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:37:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:37:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:37:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:37:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:37:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:37:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:37:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:37:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:37:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:37:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:37:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:37:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:37:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:37:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:37:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:37:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:37:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:37:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:37:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:37:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:37:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:37:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:37:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 23:37:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:37:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-22 23:37:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:05,733 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-22 23:37:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:37:05,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289095372] [2022-07-22 23:37:05,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289095372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:37:05,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351937652] [2022-07-22 23:37:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:37:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:37:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:37:05,749 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-22 23:37:05,750 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-22 23:37:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:07,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 4904 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 23:37:07,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:37:07,151 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-22 23:37:07,196 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-22 23:37:07,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:37:07,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351937652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:37:07,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:37:07,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2022-07-22 23:37:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469796433] [2022-07-22 23:37:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:37:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:37:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:37:07,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:37:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2022-07-22 23:37:07,199 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-22 23:37:11,735 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-22 23:37:13,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:37:16,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:37:18,321 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-22 23:37:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:37:18,576 INFO L93 Difference]: Finished difference Result 34371 states and 52374 transitions. [2022-07-22 23:37:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:37:18,577 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-22 23:37:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:37:18,658 INFO L225 Difference]: With dead ends: 34371 [2022-07-22 23:37:18,659 INFO L226 Difference]: Without dead ends: 17562 [2022-07-22 23:37:18,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-22 23:37:18,701 INFO L413 NwaCegarLoop]: 5818 mSDtfsCounter, 26 mSDsluCounter, 16529 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22347 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-22 23:37:18,702 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.9s Time] [2022-07-22 23:37:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17562 states. [2022-07-22 23:37:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17562 to 17400. [2022-07-22 23:37:19,238 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-22 23:37:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 26382 transitions. [2022-07-22 23:37:19,283 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 26382 transitions. Word has length 277 [2022-07-22 23:37:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:37:19,284 INFO L495 AbstractCegarLoop]: Abstraction has 17400 states and 26382 transitions. [2022-07-22 23:37:19,284 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-22 23:37:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 26382 transitions. [2022-07-22 23:37:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-22 23:37:19,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:37:19,293 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-22 23:37:19,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 23:37:19,507 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-22 23:37:19,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:37:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:37:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -459269918, now seen corresponding path program 1 times [2022-07-22 23:37:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:37:19,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505621648] [2022-07-22 23:37:19,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:37:19,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:37:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:37:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:37:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:37:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:37:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:37:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:37:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:37:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:37:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:37:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:37:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:37:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:37:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:37:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:37:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:37:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:37:19,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:37:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:37:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:37:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:37:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:37:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:37:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:37:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:37:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:37:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:37:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:37:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:37:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 23:37:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:37:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-22 23:37:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-22 23:37:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:19,942 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-22 23:37:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:37:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505621648] [2022-07-22 23:37:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505621648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:37:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:37:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:37:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546733825] [2022-07-22 23:37:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:37:19,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:37:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:37:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:37:19,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:37:19,946 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-22 23:37:28,976 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-22 23:37:36,228 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-22 23:37:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:37:37,178 INFO L93 Difference]: Finished difference Result 37107 states and 56836 transitions. [2022-07-22 23:37:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:37:37,179 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-22 23:37:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:37:37,272 INFO L225 Difference]: With dead ends: 37107 [2022-07-22 23:37:37,273 INFO L226 Difference]: Without dead ends: 20268 [2022-07-22 23:37:37,318 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-22 23:37:37,319 INFO L413 NwaCegarLoop]: 5398 mSDtfsCounter, 5489 mSDsluCounter, 8512 mSDsCounter, 0 mSdLazyCounter, 9006 mSolverCounterSat, 1759 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5841 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 10767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1759 IncrementalHoareTripleChecker+Valid, 9006 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:37:37,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5841 Valid, 13910 Invalid, 10767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1759 Valid, 9006 Invalid, 2 Unknown, 0 Unchecked, 16.3s Time] [2022-07-22 23:37:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20268 states. [2022-07-22 23:37:38,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20268 to 18512. [2022-07-22 23:37:38,061 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-22 23:37:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18512 states to 18512 states and 28246 transitions. [2022-07-22 23:37:38,119 INFO L78 Accepts]: Start accepts. Automaton has 18512 states and 28246 transitions. Word has length 279 [2022-07-22 23:37:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:37:38,120 INFO L495 AbstractCegarLoop]: Abstraction has 18512 states and 28246 transitions. [2022-07-22 23:37:38,120 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-22 23:37:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18512 states and 28246 transitions. [2022-07-22 23:37:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-22 23:37:38,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:37:38,129 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-22 23:37:38,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 23:37:38,130 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:37:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:37:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1268616544, now seen corresponding path program 1 times [2022-07-22 23:37:38,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:37:38,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365649365] [2022-07-22 23:37:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:37:38,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:37:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:37:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:37:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:37:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:37:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:37:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:37:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:37:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:37:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:37:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:37:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:37:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:37:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:37:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:37:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:37:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:37:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:37:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:37:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:37:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:37:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:37:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:37:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:37:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:37:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:37:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:37:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:37:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:37:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-22 23:37:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:37:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:37:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:37:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-07-22 23:37:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-22 23:37:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:37:38,568 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-22 23:37:38,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:37:38,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365649365] [2022-07-22 23:37:38,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365649365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:37:38,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:37:38,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 23:37:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36634977] [2022-07-22 23:37:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:37:38,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 23:37:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:37:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 23:37:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 23:37:38,571 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-22 23:37:47,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:37:49,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:37:50,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:37:59,297 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-22 23:38:01,674 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-22 23:38:24,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:38:27,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:38:30,507 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-22 23:38:33,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:38:33,127 INFO L93 Difference]: Finished difference Result 51859 states and 80071 transitions. [2022-07-22 23:38:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 23:38:33,128 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-22 23:38:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:38:33,263 INFO L225 Difference]: With dead ends: 51859 [2022-07-22 23:38:33,263 INFO L226 Difference]: Without dead ends: 39401 [2022-07-22 23:38:33,305 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-22 23:38:33,305 INFO L413 NwaCegarLoop]: 10803 mSDtfsCounter, 11322 mSDsluCounter, 37019 mSDsCounter, 0 mSdLazyCounter, 40106 mSolverCounterSat, 3634 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11855 SdHoareTripleChecker+Valid, 47822 SdHoareTripleChecker+Invalid, 43743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3634 IncrementalHoareTripleChecker+Valid, 40106 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:38:33,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11855 Valid, 47822 Invalid, 43743 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3634 Valid, 40106 Invalid, 3 Unknown, 0 Unchecked, 52.7s Time] [2022-07-22 23:38:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39401 states. [2022-07-22 23:38:34,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39401 to 36439. [2022-07-22 23:38:34,345 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-22 23:38:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36439 states to 36439 states and 55940 transitions. [2022-07-22 23:38:34,467 INFO L78 Accepts]: Start accepts. Automaton has 36439 states and 55940 transitions. Word has length 279 [2022-07-22 23:38:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:38:34,468 INFO L495 AbstractCegarLoop]: Abstraction has 36439 states and 55940 transitions. [2022-07-22 23:38:34,468 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-22 23:38:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36439 states and 55940 transitions. [2022-07-22 23:38:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-22 23:38:34,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:38:34,476 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-22 23:38:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 23:38:34,477 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:38:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:38:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 634260467, now seen corresponding path program 1 times [2022-07-22 23:38:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:38:34,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394699100] [2022-07-22 23:38:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:38:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:38:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:38:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:38:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:38:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-22 23:38:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-22 23:38:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 23:38:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-22 23:38:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:38:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-22 23:38:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:38:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:38:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 23:38:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 23:38:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:38:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-22 23:38:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 23:38:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 23:38:34,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-22 23:38:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:38:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 23:38:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 23:38:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 23:38:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:34,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-22 23:38:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 23:38:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-22 23:38:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-22 23:38:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-22 23:38:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 23:38:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-22 23:38:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-22 23:38:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-22 23:38:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-22 23:38:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-22 23:38:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-22 23:38:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-22 23:38:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:35,271 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-22 23:38:35,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:38:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394699100] [2022-07-22 23:38:35,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394699100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:38:35,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863085460] [2022-07-22 23:38:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:38:35,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:38:35,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:38:35,304 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-22 23:38:35,305 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-22 23:38:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:38:36,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 5094 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-22 23:38:36,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:38:36,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:36,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:36,683 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 23:38:36,683 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-22 23:38:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:36,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:36,701 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-22 23:38:36,701 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-22 23:38:37,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:37,472 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-22 23:38:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:37,477 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-22 23:38:37,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:37,688 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-22 23:38:37,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 23:38:37,692 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-22 23:38:38,161 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-22 23:38:38,164 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-22 23:38:38,200 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-22 23:38:38,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:38:50,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863085460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:38:50,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:38:50,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 24 [2022-07-22 23:38:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679552118] [2022-07-22 23:38:50,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:38:50,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 23:38:50,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:38:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 23:38:50,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-22 23:38:50,610 INFO L87 Difference]: Start difference. First operand 36439 states and 55940 transitions. Second operand has 24 states, 23 states have (on average 10.478260869565217) internal successors, (241), 17 states have internal predecessors, (241), 11 states have call successors, (75), 11 states have call predecessors, (75), 7 states have return successors, (69), 12 states have call predecessors, (69), 10 states have call successors, (69) [2022-07-22 23:39:10,983 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-22 23:39:13,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []