./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.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 36ffbabf76f0a0e87302d8b80308134217d4fdef380ae154dfcdec710817c6e2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:58:35,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:58:35,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:58:35,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:58:35,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:58:35,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:58:35,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:58:35,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:58:35,969 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:58:35,970 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:58:35,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:58:35,972 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:58:35,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:58:35,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:58:35,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:58:35,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:58:35,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:58:35,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:58:35,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:58:35,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:58:35,990 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:58:35,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:58:35,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:58:35,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:58:35,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:58:36,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:58:36,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:58:36,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:58:36,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:58:36,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:58:36,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:58:36,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:58:36,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:58:36,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:58:36,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:58:36,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:58:36,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:58:36,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:58:36,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:58:36,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:58:36,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:58:36,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:58:36,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:58:36,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:58:36,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:58:36,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:58:36,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:58:36,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:58:36,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:58:36,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:58:36,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:58:36,052 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:58:36,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:58:36,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:58:36,054 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:58:36,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:58:36,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:58:36,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:58:36,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:58:36,055 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:58:36,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:58:36,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:58:36,056 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:58:36,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:58:36,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:58:36,057 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:58:36,057 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:58:36,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:58:36,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:58:36,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:58:36,058 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:58:36,058 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:58:36,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:58:36,059 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 -> 36ffbabf76f0a0e87302d8b80308134217d4fdef380ae154dfcdec710817c6e2 [2022-07-19 23:58:36,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:58:36,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:58:36,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:58:36,323 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:58:36,324 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:58:36,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-19 23:58:36,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a15b9449/1694c9fe45d046cba24f3d7fc7e4d6f7/FLAG412b7dc9c [2022-07-19 23:58:37,126 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:58:37,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-19 23:58:37,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a15b9449/1694c9fe45d046cba24f3d7fc7e4d6f7/FLAG412b7dc9c [2022-07-19 23:58:37,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a15b9449/1694c9fe45d046cba24f3d7fc7e4d6f7 [2022-07-19 23:58:37,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:58:37,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:58:37,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:58:37,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:58:37,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:58:37,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:58:37" (1/1) ... [2022-07-19 23:58:37,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344ebaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:37, skipping insertion in model container [2022-07-19 23:58:37,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:58:37" (1/1) ... [2022-07-19 23:58:37,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:58:37,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:58:37,915 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3834] [2022-07-19 23:58:37,915 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3835-3836] [2022-07-19 23:58:38,237 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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[119274,119287] [2022-07-19 23:58:38,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:58:38,989 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:58:39,041 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3834] [2022-07-19 23:58:39,041 WARN L1251 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3835-3836] [2022-07-19 23:58:39,060 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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[119274,119287] [2022-07-19 23:58:39,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:58:39,427 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:58:39,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39 WrapperNode [2022-07-19 23:58:39,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:58:39,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:58:39,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:58:39,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:58:39,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,739 INFO L137 Inliner]: procedures = 264, calls = 3505, calls flagged for inlining = 131, calls inlined = 111, statements flattened = 6344 [2022-07-19 23:58:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:58:39,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:58:39,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:58:39,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:58:39,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:39,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:40,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:58:40,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:58:40,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:58:40,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:58:40,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (1/1) ... [2022-07-19 23:58:40,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:58:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:58:40,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 23:58:40,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 23:58:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure acm_disconnect [2022-07-19 23:58:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_disconnect [2022-07-19 23:58:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_tty_hangup [2022-07-19 23:58:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_tty_hangup [2022-07-19 23:58:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2022-07-19 23:58:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-19 23:58:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-19 23:58:40,114 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-19 23:58:40,114 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-19 23:58:40,114 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-19 23:58:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:58:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:58:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:58:40,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:58:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-19 23:58:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-19 23:58:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_cleanup [2022-07-19 23:58:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_cleanup [2022-07-19 23:58:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-19 23:58:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-19 23:58:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2022-07-19 23:58:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2022-07-19 23:58:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:58:40,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:58:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-07-19 23:58:40,117 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-07-19 23:58:40,117 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-19 23:58:40,117 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-19 23:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_buffers_free [2022-07-19 23:58:40,118 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_buffers_free [2022-07-19 23:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-19 23:58:40,118 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-19 23:58:40,118 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-19 23:58:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-19 23:58:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:58:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:58:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-19 23:58:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-19 23:58:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-07-19 23:58:40,119 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-07-19 23:58:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 23:58:40,120 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 23:58:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:58:40,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:58:40,120 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 23:58:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 23:58:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_put [2022-07-19 23:58:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_put [2022-07-19 23:58:40,121 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_chars_in_buffer [2022-07-19 23:58:40,121 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_chars_in_buffer [2022-07-19 23:58:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure acm_resume [2022-07-19 23:58:40,122 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_resume [2022-07-19 23:58:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:58:40,123 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-19 23:58:40,123 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-19 23:58:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-19 23:58:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_msg [2022-07-19 23:58:40,124 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_msg [2022-07-19 23:58:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-19 23:58:40,124 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-19 23:58:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:58:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_hangup [2022-07-19 23:58:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_hangup [2022-07-19 23:58:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-07-19 23:58:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-07-19 23:58:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2022-07-19 23:58:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2022-07-19 23:58:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-19 23:58:40,126 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-19 23:58:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:58:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:58:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 23:58:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 23:58:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure put_tty_driver [2022-07-19 23:58:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure put_tty_driver [2022-07-19 23:58:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-19 23:58:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-19 23:58:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmget [2022-07-19 23:58:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmget [2022-07-19 23:58:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-19 23:58:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-19 23:58:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_set_termios [2022-07-19 23:58:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_set_termios [2022-07-19 23:58:40,128 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_from_anchor [2022-07-19 23:58:40,128 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_from_anchor [2022-07-19 23:58:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-19 23:58:40,129 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-19 23:58:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:58:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:58:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:58:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 23:58:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 23:58:40,131 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_break_ctl [2022-07-19 23:58:40,131 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_break_ctl [2022-07-19 23:58:40,131 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 23:58:40,131 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 23:58:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:58:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-19 23:58:40,132 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-19 23:58:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:58:40,132 INFO L130 BoogieDeclarations]: Found specification of procedure acm_start_wb [2022-07-19 23:58:40,132 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_start_wb [2022-07-19 23:58:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-19 23:58:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-19 23:58:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:58:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:58:40,133 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-19 23:58:40,133 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-19 23:58:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_throttle [2022-07-19 23:58:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_throttle [2022-07-19 23:58:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure acm_wb_is_avail [2022-07-19 23:58:40,134 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_wb_is_avail [2022-07-19 23:58:40,134 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-19 23:58:40,135 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-19 23:58:40,135 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-19 23:58:40,137 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-19 23:58:40,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-19 23:58:40,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-19 23:58:40,139 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_write_room [2022-07-19 23:58:40,139 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_write_room [2022-07-19 23:58:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urb [2022-07-19 23:58:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urb [2022-07-19 23:58:40,140 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-19 23:58:40,140 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-19 23:58:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:58:40,145 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:58:40,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-19 23:58:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-19 23:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_done [2022-07-19 23:58:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_done [2022-07-19 23:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_ioctl [2022-07-19 23:58:40,146 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_ioctl [2022-07-19 23:58:40,146 INFO L130 BoogieDeclarations]: Found specification of procedure acm_release_minor [2022-07-19 23:58:40,147 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_release_minor [2022-07-19 23:58:40,147 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-19 23:58:40,147 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-19 23:58:40,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:58:40,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:58:40,147 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-07-19 23:58:40,147 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_unthrottle [2022-07-19 23:58:40,148 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_unthrottle [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-19 23:58:40,148 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-19 23:58:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-19 23:58:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-19 23:58:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-19 23:58:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-07-19 23:58:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-07-19 23:58:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_dtr_rts [2022-07-19 23:58:40,149 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_dtr_rts [2022-07-19 23:58:40,149 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-19 23:58:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-19 23:58:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-19 23:58:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-19 23:58:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_buffers_free [2022-07-19 23:58:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_buffers_free [2022-07-19 23:58:40,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urbs [2022-07-19 23:58:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urbs [2022-07-19 23:58:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_install [2022-07-19 23:58:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_install [2022-07-19 23:58:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure stop_data_traffic [2022-07-19 23:58:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_data_traffic [2022-07-19 23:58:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-19 23:58:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-19 23:58:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-19 23:58:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-19 23:58:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:58:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-19 23:58:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-19 23:58:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-19 23:58:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-19 23:58:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmset [2022-07-19 23:58:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmset [2022-07-19 23:58:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:58:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:58:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_driver [2022-07-19 23:58:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_driver [2022-07-19 23:58:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-19 23:58:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-19 23:58:40,802 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:58:40,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:58:41,042 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:58:52,831 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:58:52,851 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:58:52,851 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 23:58:52,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:58:52 BoogieIcfgContainer [2022-07-19 23:58:52,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:58:52,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:58:52,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:58:52,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:58:52,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:58:37" (1/3) ... [2022-07-19 23:58:52,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de2b915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:58:52, skipping insertion in model container [2022-07-19 23:58:52,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:58:39" (2/3) ... [2022-07-19 23:58:52,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5de2b915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:58:52, skipping insertion in model container [2022-07-19 23:58:52,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:58:52" (3/3) ... [2022-07-19 23:58:52,864 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-07-19 23:58:52,878 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:58:52,879 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:58:52,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:58:52,970 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@43d0e5f2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12a2b4d0 [2022-07-19 23:58:52,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:58:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 1465 states, 1052 states have (on average 1.346958174904943) internal successors, (1417), 1067 states have internal predecessors, (1417), 330 states have call successors, (330), 82 states have call predecessors, (330), 81 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) [2022-07-19 23:58:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 23:58:53,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:58:53,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:58:53,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:58:53,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:58:53,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1962807764, now seen corresponding path program 1 times [2022-07-19 23:58:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:58:53,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516132282] [2022-07-19 23:58:53,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:58:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:58:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:58:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:58:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:58:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:58:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:58:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:58:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:58:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:58:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:58:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:58:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:58:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:58:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:58:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:58:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:58:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:58:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 23:58:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 23:58:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 23:58:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:58:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-19 23:58:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:58:54,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516132282] [2022-07-19 23:58:54,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516132282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:58:54,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:58:54,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:58:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403783942] [2022-07-19 23:58:54,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:58:54,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:58:54,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:58:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:58:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:58:54,217 INFO L87 Difference]: Start difference. First operand has 1465 states, 1052 states have (on average 1.346958174904943) internal successors, (1417), 1067 states have internal predecessors, (1417), 330 states have call successors, (330), 82 states have call predecessors, (330), 81 states have return successors, (322), 322 states have call predecessors, (322), 322 states have call successors, (322) Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 23:58:58,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:00,876 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:02,920 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:05,588 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:07,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:10,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:59:13,944 INFO L93 Difference]: Finished difference Result 4318 states and 6265 transitions. [2022-07-19 23:59:13,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:59:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 130 [2022-07-19 23:59:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:59:13,987 INFO L225 Difference]: With dead ends: 4318 [2022-07-19 23:59:13,988 INFO L226 Difference]: Without dead ends: 2817 [2022-07-19 23:59:13,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:59:14,002 INFO L413 NwaCegarLoop]: 2173 mSDtfsCounter, 2699 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 1513 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2934 SdHoareTripleChecker+Valid, 5566 SdHoareTripleChecker+Invalid, 3669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1513 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:59:14,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2934 Valid, 5566 Invalid, 3669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1513 Valid, 2150 Invalid, 6 Unknown, 0 Unchecked, 19.3s Time] [2022-07-19 23:59:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2022-07-19 23:59:14,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2726. [2022-07-19 23:59:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 1977 states have (on average 1.3343449671219019) internal successors, (2638), 1987 states have internal predecessors, (2638), 589 states have call successors, (589), 160 states have call predecessors, (589), 159 states have return successors, (588), 588 states have call predecessors, (588), 588 states have call successors, (588) [2022-07-19 23:59:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3815 transitions. [2022-07-19 23:59:14,256 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3815 transitions. Word has length 130 [2022-07-19 23:59:14,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:59:14,257 INFO L495 AbstractCegarLoop]: Abstraction has 2726 states and 3815 transitions. [2022-07-19 23:59:14,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-19 23:59:14,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3815 transitions. [2022-07-19 23:59:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-19 23:59:14,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:59:14,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:59:14,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:59:14,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:59:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:59:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1585813839, now seen corresponding path program 1 times [2022-07-19 23:59:14,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:59:14,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479284399] [2022-07-19 23:59:14,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:59:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:59:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:59:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:59:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:59:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:59:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:59:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:59:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:59:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:59:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:59:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:59:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:59:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:59:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:59:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:59:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:59:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 23:59:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 23:59:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-19 23:59:14,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:59:14,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479284399] [2022-07-19 23:59:14,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479284399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:59:14,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:59:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:59:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104837274] [2022-07-19 23:59:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:59:14,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:59:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:59:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:59:14,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:59:14,840 INFO L87 Difference]: Start difference. First operand 2726 states and 3815 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 23:59:18,173 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:20,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:24,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:27,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:29,923 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:33,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:35,879 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 [] [2022-07-19 23:59:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:59:38,366 INFO L93 Difference]: Finished difference Result 7333 states and 10275 transitions. [2022-07-19 23:59:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:59:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2022-07-19 23:59:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:59:38,393 INFO L225 Difference]: With dead ends: 7333 [2022-07-19 23:59:38,393 INFO L226 Difference]: Without dead ends: 4640 [2022-07-19 23:59:38,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:59:38,404 INFO L413 NwaCegarLoop]: 2146 mSDtfsCounter, 2638 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 1950 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1950 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:59:38,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 5575 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1950 Valid, 3528 Invalid, 7 Unknown, 0 Unchecked, 23.1s Time] [2022-07-19 23:59:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2022-07-19 23:59:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4479. [2022-07-19 23:59:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4479 states, 3220 states have (on average 1.3186335403726708) internal successors, (4246), 3239 states have internal predecessors, (4246), 978 states have call successors, (978), 281 states have call predecessors, (978), 280 states have return successors, (977), 976 states have call predecessors, (977), 977 states have call successors, (977) [2022-07-19 23:59:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4479 states to 4479 states and 6201 transitions. [2022-07-19 23:59:38,575 INFO L78 Accepts]: Start accepts. Automaton has 4479 states and 6201 transitions. Word has length 130 [2022-07-19 23:59:38,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:59:38,575 INFO L495 AbstractCegarLoop]: Abstraction has 4479 states and 6201 transitions. [2022-07-19 23:59:38,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 23:59:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4479 states and 6201 transitions. [2022-07-19 23:59:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-19 23:59:38,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:59:38,578 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-07-19 23:59:38,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:59:38,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:59:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:59:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2014104137, now seen corresponding path program 1 times [2022-07-19 23:59:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:59:38,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844289629] [2022-07-19 23:59:38,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:59:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:59:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:59:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:59:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:59:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:59:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:59:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 23:59:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:59:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:59:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 23:59:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:59:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:59:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:59:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:59:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:59:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 23:59:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 23:59:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 23:59:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 23:59:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 23:59:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:59:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 23:59:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:59:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2022-07-19 23:59:39,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:59:39,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844289629] [2022-07-19 23:59:39,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844289629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:59:39,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:59:39,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:59:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217442931] [2022-07-19 23:59:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:59:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:59:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:59:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:59:39,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:59:39,102 INFO L87 Difference]: Start difference. First operand 4479 states and 6201 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 23:59:41,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:43,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:48,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:50,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:54,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:57,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:59:59,112 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-20 00:00:01,160 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 [] [2022-07-20 00:00:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:02,899 INFO L93 Difference]: Finished difference Result 11109 states and 15446 transitions. [2022-07-20 00:00:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:00:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2022-07-20 00:00:02,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:02,939 INFO L225 Difference]: With dead ends: 11109 [2022-07-20 00:00:02,940 INFO L226 Difference]: Without dead ends: 6663 [2022-07-20 00:00:02,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-20 00:00:02,959 INFO L413 NwaCegarLoop]: 1963 mSDtfsCounter, 2824 mSDsluCounter, 3316 mSDsCounter, 0 mSdLazyCounter, 3214 mSolverCounterSat, 1955 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3015 SdHoareTripleChecker+Valid, 5279 SdHoareTripleChecker+Invalid, 5177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1955 IncrementalHoareTripleChecker+Valid, 3214 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:02,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3015 Valid, 5279 Invalid, 5177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1955 Valid, 3214 Invalid, 8 Unknown, 0 Unchecked, 23.4s Time] [2022-07-20 00:00:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-07-20 00:00:03,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6393. [2022-07-20 00:00:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6393 states, 4651 states have (on average 1.3283164910771876) internal successors, (6178), 4675 states have internal predecessors, (6178), 1325 states have call successors, (1325), 417 states have call predecessors, (1325), 416 states have return successors, (1324), 1322 states have call predecessors, (1324), 1324 states have call successors, (1324) [2022-07-20 00:00:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 8827 transitions. [2022-07-20 00:00:03,260 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 8827 transitions. Word has length 148 [2022-07-20 00:00:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:03,261 INFO L495 AbstractCegarLoop]: Abstraction has 6393 states and 8827 transitions. [2022-07-20 00:00:03,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-20 00:00:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 8827 transitions. [2022-07-20 00:00:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-20 00:00:03,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:03,272 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-20 00:00:03,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:00:03,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1585274107, now seen corresponding path program 1 times [2022-07-20 00:00:03,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:03,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918672299] [2022-07-20 00:00:03,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:03,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:00:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:00:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:00:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:00:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:00:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:00:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:00:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:00:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:00:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:00:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:00:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:00:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-20 00:00:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 00:00:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:00:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:00:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-20 00:00:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 00:00:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-20 00:00:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2022-07-20 00:00:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:03,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918672299] [2022-07-20 00:00:03,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918672299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:03,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:03,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:00:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776276221] [2022-07-20 00:00:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:03,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:00:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:00:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:00:03,772 INFO L87 Difference]: Start difference. First operand 6393 states and 8827 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:00:06,736 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-20 00:00:08,770 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-20 00:00:13,529 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-20 00:00:19,489 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-20 00:00:21,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:00:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:24,292 INFO L93 Difference]: Finished difference Result 13039 states and 18106 transitions. [2022-07-20 00:00:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:00:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 182 [2022-07-20 00:00:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:24,383 INFO L225 Difference]: With dead ends: 13039 [2022-07-20 00:00:24,383 INFO L226 Difference]: Without dead ends: 6668 [2022-07-20 00:00:24,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:00:24,408 INFO L413 NwaCegarLoop]: 1900 mSDtfsCounter, 615 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 743 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 7492 SdHoareTripleChecker+Invalid, 3596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:24,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 7492 Invalid, 3596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 2848 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2022-07-20 00:00:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2022-07-20 00:00:24,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6393. [2022-07-20 00:00:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6393 states, 4651 states have (on average 1.3265964308750806) internal successors, (6170), 4675 states have internal predecessors, (6170), 1325 states have call successors, (1325), 417 states have call predecessors, (1325), 416 states have return successors, (1324), 1322 states have call predecessors, (1324), 1324 states have call successors, (1324) [2022-07-20 00:00:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6393 states to 6393 states and 8819 transitions. [2022-07-20 00:00:24,807 INFO L78 Accepts]: Start accepts. Automaton has 6393 states and 8819 transitions. Word has length 182 [2022-07-20 00:00:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:24,809 INFO L495 AbstractCegarLoop]: Abstraction has 6393 states and 8819 transitions. [2022-07-20 00:00:24,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:00:24,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6393 states and 8819 transitions. [2022-07-20 00:00:24,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-20 00:00:24,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:24,827 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 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] [2022-07-20 00:00:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:00:24,827 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 772777665, now seen corresponding path program 1 times [2022-07-20 00:00:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:24,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945253840] [2022-07-20 00:00:24,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:00:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:00:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:00:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:00:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:00:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:00:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:00:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:00:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:00:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:00:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:00:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:00:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:00:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 00:00:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 00:00:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-20 00:00:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:00:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-20 00:00:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-07-20 00:00:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945253840] [2022-07-20 00:00:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945253840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:00:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185364710] [2022-07-20 00:00:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:00:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:25,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:00:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:00:25,797 INFO L87 Difference]: Start difference. First operand 6393 states and 8819 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:00:28,678 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-20 00:00:30,706 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-20 00:00:34,122 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-20 00:00:42,491 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-20 00:00:44,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:00:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:00:48,508 INFO L93 Difference]: Finished difference Result 16011 states and 22874 transitions. [2022-07-20 00:00:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 00:00:48,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 193 [2022-07-20 00:00:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:00:48,613 INFO L225 Difference]: With dead ends: 16011 [2022-07-20 00:00:48,614 INFO L226 Difference]: Without dead ends: 9664 [2022-07-20 00:00:48,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:00:48,634 INFO L413 NwaCegarLoop]: 2624 mSDtfsCounter, 3557 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 4625 mSolverCounterSat, 2025 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3817 SdHoareTripleChecker+Valid, 9099 SdHoareTripleChecker+Invalid, 6655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2025 IncrementalHoareTripleChecker+Valid, 4625 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:00:48,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3817 Valid, 9099 Invalid, 6655 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2025 Valid, 4625 Invalid, 5 Unknown, 0 Unchecked, 22.1s Time] [2022-07-20 00:00:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2022-07-20 00:00:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 6493. [2022-07-20 00:00:49,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6493 states, 4715 states have (on average 1.3238600212089078) internal successors, (6242), 4739 states have internal predecessors, (6242), 1345 states have call successors, (1345), 433 states have call predecessors, (1345), 432 states have return successors, (1344), 1342 states have call predecessors, (1344), 1344 states have call successors, (1344) [2022-07-20 00:00:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6493 states to 6493 states and 8931 transitions. [2022-07-20 00:00:49,028 INFO L78 Accepts]: Start accepts. Automaton has 6493 states and 8931 transitions. Word has length 193 [2022-07-20 00:00:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:00:49,029 INFO L495 AbstractCegarLoop]: Abstraction has 6493 states and 8931 transitions. [2022-07-20 00:00:49,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:00:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 6493 states and 8931 transitions. [2022-07-20 00:00:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-20 00:00:49,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:00:49,041 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-20 00:00:49,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:00:49,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:00:49,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:00:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2013342847, now seen corresponding path program 1 times [2022-07-20 00:00:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:00:49,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301078267] [2022-07-20 00:00:49,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:00:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:00:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:00:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:00:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:00:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:00:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:00:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:00:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:00:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:00:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:00:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:00:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:00:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:00:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:00:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:00:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:00:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:00:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:00:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:00:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:00:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 00:00:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:00:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:00:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 00:00:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-20 00:00:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:00:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 00:00:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:00:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-07-20 00:00:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:00:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301078267] [2022-07-20 00:00:49,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301078267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:00:49,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:00:49,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:00:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981811661] [2022-07-20 00:00:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:00:49,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:00:49,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:00:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:00:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:00:49,801 INFO L87 Difference]: Start difference. First operand 6493 states and 8931 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 00:00:52,876 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-20 00:00:59,215 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-20 00:01:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:01:00,998 INFO L93 Difference]: Finished difference Result 7043 states and 9703 transitions. [2022-07-20 00:01:00,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:01:01,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 190 [2022-07-20 00:01:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:01:01,025 INFO L225 Difference]: With dead ends: 7043 [2022-07-20 00:01:01,025 INFO L226 Difference]: Without dead ends: 7040 [2022-07-20 00:01:01,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:01:01,030 INFO L413 NwaCegarLoop]: 1920 mSDtfsCounter, 2487 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 1296 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2706 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1296 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:01:01,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2706 Valid, 3892 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1296 Valid, 1229 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2022-07-20 00:01:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7040 states. [2022-07-20 00:01:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7040 to 6735. [2022-07-20 00:01:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6735 states, 4878 states have (on average 1.3183681836818368) internal successors, (6431), 4902 states have internal predecessors, (6431), 1375 states have call successors, (1375), 482 states have call predecessors, (1375), 481 states have return successors, (1374), 1372 states have call predecessors, (1374), 1374 states have call successors, (1374) [2022-07-20 00:01:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6735 states to 6735 states and 9180 transitions. [2022-07-20 00:01:01,291 INFO L78 Accepts]: Start accepts. Automaton has 6735 states and 9180 transitions. Word has length 190 [2022-07-20 00:01:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:01:01,296 INFO L495 AbstractCegarLoop]: Abstraction has 6735 states and 9180 transitions. [2022-07-20 00:01:01,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-20 00:01:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 6735 states and 9180 transitions. [2022-07-20 00:01:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-20 00:01:01,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:01:01,309 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-07-20 00:01:01,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:01:01,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:01:01,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:01:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1636348922, now seen corresponding path program 1 times [2022-07-20 00:01:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:01:01,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792445425] [2022-07-20 00:01:01,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:01:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:01:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:01:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:01:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:01:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:01:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:01:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:01:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:01:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:01:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:01:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:01:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:01:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:01:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:01:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:01:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:01:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:01:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:01:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:01:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 00:01:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:01:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:01:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 00:01:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 00:01:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-07-20 00:01:01,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:01:01,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792445425] [2022-07-20 00:01:01,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792445425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:01:01,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:01:01,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:01:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382925679] [2022-07-20 00:01:01,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:01:01,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:01:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:01:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:01:01,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:01:01,946 INFO L87 Difference]: Start difference. First operand 6735 states and 9180 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 00:01:04,786 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-20 00:01:10,883 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-20 00:01:15,682 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-20 00:01:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:01:19,498 INFO L93 Difference]: Finished difference Result 17969 states and 24626 transitions. [2022-07-20 00:01:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:01:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 190 [2022-07-20 00:01:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:01:19,594 INFO L225 Difference]: With dead ends: 17969 [2022-07-20 00:01:19,594 INFO L226 Difference]: Without dead ends: 11280 [2022-07-20 00:01:19,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:01:19,632 INFO L413 NwaCegarLoop]: 2832 mSDtfsCounter, 3595 mSDsluCounter, 4522 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 2489 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3854 SdHoareTripleChecker+Valid, 7354 SdHoareTripleChecker+Invalid, 6554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2489 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:01:19,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3854 Valid, 7354 Invalid, 6554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2489 Valid, 4062 Invalid, 3 Unknown, 0 Unchecked, 16.9s Time] [2022-07-20 00:01:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11280 states. [2022-07-20 00:01:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11280 to 10712. [2022-07-20 00:01:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10712 states, 7830 states have (on average 1.3154533844189016) internal successors, (10300), 7868 states have internal predecessors, (10300), 2110 states have call successors, (2110), 772 states have call predecessors, (2110), 771 states have return successors, (2109), 2105 states have call predecessors, (2109), 2109 states have call successors, (2109) [2022-07-20 00:01:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10712 states to 10712 states and 14519 transitions. [2022-07-20 00:01:20,462 INFO L78 Accepts]: Start accepts. Automaton has 10712 states and 14519 transitions. Word has length 190 [2022-07-20 00:01:20,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:01:20,464 INFO L495 AbstractCegarLoop]: Abstraction has 10712 states and 14519 transitions. [2022-07-20 00:01:20,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-20 00:01:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10712 states and 14519 transitions. [2022-07-20 00:01:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-20 00:01:20,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:01:20,488 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 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] [2022-07-20 00:01:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:01:20,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:01:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:01:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -694616547, now seen corresponding path program 1 times [2022-07-20 00:01:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:01:20,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13437029] [2022-07-20 00:01:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:01:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:01:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:01:21,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:01:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:01:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:01:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:01:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:01:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:01:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:01:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:01:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:01:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:01:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:01:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:01:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:01:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:01:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:01:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:01:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:01:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-20 00:01:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-20 00:01:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 00:01:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:01:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 00:01:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 00:01:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-20 00:01:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-07-20 00:01:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:01:21,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13437029] [2022-07-20 00:01:21,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13437029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:01:21,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:01:21,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:01:21,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754862048] [2022-07-20 00:01:21,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:01:21,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:01:21,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:01:21,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:01:21,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:01:21,497 INFO L87 Difference]: Start difference. First operand 10712 states and 14519 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 00:01:24,212 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-20 00:01:31,720 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-20 00:01:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:01:34,593 INFO L93 Difference]: Finished difference Result 21941 states and 29849 transitions. [2022-07-20 00:01:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:01:34,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2022-07-20 00:01:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:01:34,646 INFO L225 Difference]: With dead ends: 21941 [2022-07-20 00:01:34,667 INFO L226 Difference]: Without dead ends: 11263 [2022-07-20 00:01:34,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:01:34,704 INFO L413 NwaCegarLoop]: 1854 mSDtfsCounter, 1405 mSDsluCounter, 3421 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 1522 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 5275 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1522 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:01:34,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 5275 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1522 Valid, 2762 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2022-07-20 00:01:34,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11263 states. [2022-07-20 00:01:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11263 to 10621. [2022-07-20 00:01:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10621 states, 7760 states have (on average 1.3163659793814433) internal successors, (10215), 7801 states have internal predecessors, (10215), 2098 states have call successors, (2098), 763 states have call predecessors, (2098), 762 states have return successors, (2097), 2090 states have call predecessors, (2097), 2097 states have call successors, (2097) [2022-07-20 00:01:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10621 states to 10621 states and 14410 transitions. [2022-07-20 00:01:35,212 INFO L78 Accepts]: Start accepts. Automaton has 10621 states and 14410 transitions. Word has length 203 [2022-07-20 00:01:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:01:35,216 INFO L495 AbstractCegarLoop]: Abstraction has 10621 states and 14410 transitions. [2022-07-20 00:01:35,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (30), 6 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-20 00:01:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 10621 states and 14410 transitions. [2022-07-20 00:01:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-20 00:01:35,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:01:35,234 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2022-07-20 00:01:35,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:01:35,234 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:01:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:01:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -48122539, now seen corresponding path program 1 times [2022-07-20 00:01:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:01:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693189435] [2022-07-20 00:01:35,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:01:35,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:01:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:01:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:01:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:01:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:01:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:01:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:01:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:01:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:01:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:01:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:01:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:01:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:01:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:01:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:01:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:01:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:01:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:01:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-20 00:01:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:01:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-20 00:01:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-20 00:01:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 00:01:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-20 00:01:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 00:01:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-20 00:01:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-20 00:01:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:35,886 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2022-07-20 00:01:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:01:35,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693189435] [2022-07-20 00:01:35,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693189435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:01:35,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:01:35,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:01:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511179363] [2022-07-20 00:01:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:01:35,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:01:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:01:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:01:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:01:35,890 INFO L87 Difference]: Start difference. First operand 10621 states and 14410 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 00:01:38,696 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-20 00:01:45,924 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-20 00:01:51,852 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-20 00:01:53,956 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-20 00:01:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:01:56,246 INFO L93 Difference]: Finished difference Result 25513 states and 34642 transitions. [2022-07-20 00:01:56,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:01:56,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 213 [2022-07-20 00:01:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:01:56,303 INFO L225 Difference]: With dead ends: 25513 [2022-07-20 00:01:56,303 INFO L226 Difference]: Without dead ends: 14938 [2022-07-20 00:01:56,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:01:56,330 INFO L413 NwaCegarLoop]: 2878 mSDtfsCounter, 2820 mSDsluCounter, 4127 mSDsCounter, 0 mSdLazyCounter, 3649 mSolverCounterSat, 1926 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3084 SdHoareTripleChecker+Valid, 7005 SdHoareTripleChecker+Invalid, 5579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1926 IncrementalHoareTripleChecker+Valid, 3649 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:01:56,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3084 Valid, 7005 Invalid, 5579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1926 Valid, 3649 Invalid, 4 Unknown, 0 Unchecked, 19.6s Time] [2022-07-20 00:01:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14938 states. [2022-07-20 00:01:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14938 to 14175. [2022-07-20 00:01:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14175 states, 10443 states have (on average 1.3174375179546107) internal successors, (13758), 10492 states have internal predecessors, (13758), 2678 states have call successors, (2678), 1054 states have call predecessors, (2678), 1053 states have return successors, (2677), 2668 states have call predecessors, (2677), 2677 states have call successors, (2677) [2022-07-20 00:01:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14175 states to 14175 states and 19113 transitions. [2022-07-20 00:01:57,067 INFO L78 Accepts]: Start accepts. Automaton has 14175 states and 19113 transitions. Word has length 213 [2022-07-20 00:01:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:01:57,068 INFO L495 AbstractCegarLoop]: Abstraction has 14175 states and 19113 transitions. [2022-07-20 00:01:57,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (31), 6 states have call predecessors, (31), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-20 00:01:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14175 states and 19113 transitions. [2022-07-20 00:01:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-20 00:01:57,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:01:57,089 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 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] [2022-07-20 00:01:57,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:01:57,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:01:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:01:57,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2009049299, now seen corresponding path program 1 times [2022-07-20 00:01:57,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:01:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529406093] [2022-07-20 00:01:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:01:57,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:01:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:01:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:01:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:01:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:01:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:01:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:01:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:01:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:01:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:01:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:01:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:01:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:01:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:01:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:01:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:01:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:01:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:01:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:01:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:01:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 00:01:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:01:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:01:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:01:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 00:01:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 00:01:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:01:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-20 00:01:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:01:57,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529406093] [2022-07-20 00:01:57,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529406093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:01:57,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:01:57,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:01:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184191699] [2022-07-20 00:01:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:01:57,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:01:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:01:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:01:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:01:57,819 INFO L87 Difference]: Start difference. First operand 14175 states and 19113 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:02:00,717 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-20 00:02:02,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:02:05,939 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-20 00:02:12,686 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-20 00:02:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:15,029 INFO L93 Difference]: Finished difference Result 29183 states and 39450 transitions. [2022-07-20 00:02:15,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 00:02:15,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 212 [2022-07-20 00:02:15,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:15,081 INFO L225 Difference]: With dead ends: 29183 [2022-07-20 00:02:15,081 INFO L226 Difference]: Without dead ends: 15017 [2022-07-20 00:02:15,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-20 00:02:15,182 INFO L413 NwaCegarLoop]: 1857 mSDtfsCounter, 1667 mSDsluCounter, 4476 mSDsCounter, 0 mSdLazyCounter, 3741 mSolverCounterSat, 1618 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1768 SdHoareTripleChecker+Valid, 6333 SdHoareTripleChecker+Invalid, 5363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1618 IncrementalHoareTripleChecker+Valid, 3741 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:15,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1768 Valid, 6333 Invalid, 5363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1618 Valid, 3741 Invalid, 4 Unknown, 0 Unchecked, 16.6s Time] [2022-07-20 00:02:15,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15017 states. [2022-07-20 00:02:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15017 to 14254. [2022-07-20 00:02:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14254 states, 10506 states have (on average 1.316009899105273) internal successors, (13826), 10556 states have internal predecessors, (13826), 2688 states have call successors, (2688), 1060 states have call predecessors, (2688), 1059 states have return successors, (2687), 2677 states have call predecessors, (2687), 2687 states have call successors, (2687) [2022-07-20 00:02:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 19201 transitions. [2022-07-20 00:02:15,859 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 19201 transitions. Word has length 212 [2022-07-20 00:02:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:15,860 INFO L495 AbstractCegarLoop]: Abstraction has 14254 states and 19201 transitions. [2022-07-20 00:02:15,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-20 00:02:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 19201 transitions. [2022-07-20 00:02:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-20 00:02:15,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:15,880 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 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] [2022-07-20 00:02:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 00:02:15,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1125540309, now seen corresponding path program 1 times [2022-07-20 00:02:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145924178] [2022-07-20 00:02:15,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:02:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:02:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:02:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:02:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:02:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:02:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:02:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:16,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:02:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:02:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:02:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 00:02:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-20 00:02:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-20 00:02:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:02:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:02:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-20 00:02:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-20 00:02:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2022-07-20 00:02:17,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145924178] [2022-07-20 00:02:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145924178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:17,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:17,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 00:02:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555889914] [2022-07-20 00:02:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 00:02:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 00:02:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 00:02:17,272 INFO L87 Difference]: Start difference. First operand 14254 states and 19201 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-20 00:02:20,622 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-20 00:02:22,673 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 [] [2022-07-20 00:02:26,319 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-20 00:02:36,845 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-20 00:02:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:02:40,837 INFO L93 Difference]: Finished difference Result 29278 states and 39527 transitions. [2022-07-20 00:02:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 00:02:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 212 [2022-07-20 00:02:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:02:40,893 INFO L225 Difference]: With dead ends: 29278 [2022-07-20 00:02:40,894 INFO L226 Difference]: Without dead ends: 15009 [2022-07-20 00:02:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2022-07-20 00:02:40,934 INFO L413 NwaCegarLoop]: 1851 mSDtfsCounter, 1680 mSDsluCounter, 8826 mSDsCounter, 0 mSdLazyCounter, 7602 mSolverCounterSat, 1633 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 10677 SdHoareTripleChecker+Invalid, 9239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1633 IncrementalHoareTripleChecker+Valid, 7602 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:02:40,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 10677 Invalid, 9239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1633 Valid, 7602 Invalid, 4 Unknown, 0 Unchecked, 22.6s Time] [2022-07-20 00:02:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15009 states. [2022-07-20 00:02:41,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15009 to 14284. [2022-07-20 00:02:41,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14284 states, 10521 states have (on average 1.3151791654785667) internal successors, (13837), 10586 states have internal predecessors, (13837), 2688 states have call successors, (2688), 1060 states have call predecessors, (2688), 1074 states have return successors, (2738), 2677 states have call predecessors, (2738), 2687 states have call successors, (2738) [2022-07-20 00:02:41,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14284 states to 14284 states and 19263 transitions. [2022-07-20 00:02:41,489 INFO L78 Accepts]: Start accepts. Automaton has 14284 states and 19263 transitions. Word has length 212 [2022-07-20 00:02:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:02:41,489 INFO L495 AbstractCegarLoop]: Abstraction has 14284 states and 19263 transitions. [2022-07-20 00:02:41,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 7 states have internal predecessors, (104), 3 states have call successors, (28), 6 states have call predecessors, (28), 2 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-20 00:02:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14284 states and 19263 transitions. [2022-07-20 00:02:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-20 00:02:41,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:02:41,510 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 3, 3, 3, 3, 3, 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] [2022-07-20 00:02:41,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 00:02:41,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:02:41,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:02:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1414599752, now seen corresponding path program 1 times [2022-07-20 00:02:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:02:41,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213410988] [2022-07-20 00:02:41,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:02:41,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:02:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-20 00:02:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 00:02:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-20 00:02:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-20 00:02:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-20 00:02:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-20 00:02:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 00:02:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:02:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:02:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:02:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 00:02:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 00:02:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-20 00:02:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 00:02:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:02:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:02:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-20 00:02:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-20 00:02:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-20 00:02:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:02:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-20 00:02:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-20 00:02:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-20 00:02:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-20 00:02:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-20 00:02:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-20 00:02:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-20 00:02:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:02:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-07-20 00:02:42,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:02:42,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213410988] [2022-07-20 00:02:42,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213410988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:02:42,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:02:42,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:02:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595246420] [2022-07-20 00:02:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:02:42,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:02:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:02:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:02:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:02:42,520 INFO L87 Difference]: Start difference. First operand 14284 states and 19263 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-20 00:02:45,338 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 []